Pick a pivot, partition elements smaller/larger around it, then recursively sort each partition. The fastest sorting algorithm in practice for most real-world data.
time:O(n log n) avg
space:O(log n)
⚡ +200_XP
step[1/22]
> Start
10
7
8
9
1
5
▸Starting array [10, 7, 8, 9, 1, 5]. Quick Sort picks a pivot and partitions.
// tap NEXT STEP to walk through one step at a time