Quicksort

Parallel Quicksort

Partition the array around a pivot, then sort partitions concurrently using parallel recursion.

String sorting algorithm that uses three-way partitioning on characters to efficiently handle repeated prefixes.

String sorting algorithm that partitions strings by the character at the current depth using three-way quicksort.

Quicksort variant using the Lomuto single-index partition scheme.

Quicksort variant that uses Hoare's two pointer partition scheme.

Quicksort variant that selects the pivot using Tukey's ninther, the median of three medians of three.

Quicksort variant that chooses the pivot as the median of the first, middle, and last elements.

Quicksort variant that preserves the relative order of equal elements.

Quicksort variant that processes elements in blocks to reduce branch misprediction and improve cache efficiency.

Quicksort variant that detects and avoids bad input patterns using adaptive partitioning and pivot selection.

Quicksort variant that partitions the array using two pivots into three regions.

Quicksort variant that partitions into less than, equal to, and greater than pivot.

Quicksort variant that selects pivots randomly to avoid worst case patterns.

Divide and conquer sorting algorithm that partitions the array around a pivot and recursively sorts both sides.

Partition around a pivot so smaller elements go left and larger go right, then recursively sort each partition in expected O(n log n) time.