QuickSort is a divide-and-conquer algorithm that selects a pivot, partitions the array, and recursively sorts the subarrays.
Partitions array around a pivot
In-place sorting with minimal extra space
Unstable due to pivot-based swaps
Performance depends on pivot selection
Optimal for average-case speed with good pivot strategies