Quick Sort Monster
Quick sort is an efficient divide-and-conquer sorting algorithm. It selects a 'pivot' element and partitions the array around it.
0
Array Size
0
Comparisons
0
Swaps
0
Total Steps
QUICK SORT
Execution Log
Ready. Click Play to start quick sort.
Sorting Challenge
Can you sort the array manually with the optimal number of swaps? Click any two bars to swap them.
š ļø Array Controls
ā” Algorithm Complexity
Worst-case Time
O(nĀ²)
Average Time
O(n log n)
Space Complexity
O(log n)