Algomination
Sorting
Searching
Data Structures
About
Contact
All sorting algorithms
Quick Sort
Time O(n log n)
Space O(log n)
Partitions around a pivot so smaller elements move left, then recurses on each side.
Visualize
Random
8
3
5
1
9
2
7
4
Starting Quick Sort.
Play
Step 1 / 32
0.5×
1×
2×
4×
Pivot
Comparing
Swapping
Sorted