Quick Sort
Pick pivot, partition into ≤/≥ regions, recurse on both sides.
Best: O(n log n)
Worst: O(n²)
Space: O(log n)
Not Stable
Load
Random
▶ Start
▷ Step
❚❚ Pause
↺ Reset
slow
fast
Pivot
Comparing
Swapping
≤ pivot / Final
> pivot
Step
0
/
0
Depth
0
Comparisons
0
Swaps
0
Algorithm Trace
Press
Start
to run.