A Pattern-defeating quicksort variant that replaces the comparison-driven partition loop with branch-free classification into offset buffers (derived from BlockQuicksort), then exchanges misplaced pairs via cyclic permutation. Pattern detection, ninther pivot selection, equal-block skip, and heapsort fallback are otherwise identical to Pattern-defeating quicksort.
Eliminates data-dependent branches in the partition step, yielding substantially faster performance on random and duplicate-heavy inputs at the cost of overhead on small or perfectly predictable inputs (sorted, reversed).