Quick Sort
← Back to Comparison-Based
A divide-and-conquer algorithm that selects a pivot, partitions elements around it, and recursively sorts the partitions. O(n log n) average case, O(n^2) worst case. In-place but not stable. Widely used due to excellent cache performance.