bwtIntrosort

private fn

void bwtIntrosort(uint[]  indices,  const(ubyte)[]  block,
       size_t lo,  size_t hi,  size_t depthLimit)

pure nothrow

Introsort implementation for BWT sorting.

Combines quicksort with heapsort fallback for guaranteed O(n log n).