Sorting Visualizer

Watch how different sorting algorithms organize data

Quick Sort

Time: O(n log n) Worst: O(n²) Space: O(log n)

Picks a 'pivot' and partitions the array: elements smaller than pivot go left, larger go right.

Comparisons 0
Swaps 0
Array Accesses 0
Time 0.00s
Unsorted
Comparing
Swapping
Pivot
Sorted