Quick Sort

Partitions an array around a pivot and recursively sorts each partition.

Pivot

Step 1 of 37

Starting Quick Sort with last-element pivot. Pick a pivot, partition around it, recurse on each half.

Comparisons

Swaps

▶Algorithm

QuickSort(arr, lo, hi):
if lo ≥ hi: return
pivot = arr[hi]
i = lo − 1
for j = lo to hi−1:
if arr[j] ≤ pivot:
i++; swap arr[i], arr[j]
swap arr[i+1], arr[hi]
QuickSort(arr, lo, i)
QuickSort(arr, i+2, hi)
// sorted

Legend

Pivot

Comparing

Swapping

Sorted

Unsorted

1 / 37Speed