Quick Sort Visualizer
How Quick Sort Works
Quick Sort selects a pivot, partitions the array around it, and recursively sorts the subarrays. It is a fast, divide-and-conquer algorithm.
- Time Complexity : O(n log n) on average
- Auxiliary Space : O(log n)