A divide-and-conquer algorithm that works by selecting a pivot element and partitioning the array around it, such that smaller elements are on the left and larger elements are on the right.
Click 'Sort' to start visualization
Step: 0/0
1. Choose a pivot element
2. Partition array around pivot
3. Recursively sort subarrays
4. Combine sorted partitions