Quick Sort

O(n log n) avg

Comparisons: 0 Swaps: 0

Speed

quickSort(arr, low, high): if low < high: pi = partition(arr, low, high) quickSort(arr, low, pi - 1) quickSort(arr, pi + 1, high)

Pivot Element

Comparing / Swapping

Sorted (Fixed)