Quick Sort

1function quickSort(arr, low, high) {
2  if (low < high) {
3    pi = partition(arr, low, high)
4    quickSort(arr, low, pi - 1)
5    quickSort(arr, pi + 1, high)
6  }
7}
8
9function partition(arr, low, high) {
10  pivot = arr[high]
11  i = low - 1
12  for j = low to high - 1:
13    if arr[j] <= pivot:
14      i++
15      swap(arr[i], arr[j])
16  swap(arr[i + 1], arr[high])
17  return i + 1
18}