QUICK_SORT.exe

function quickSort(arr, low, high) {
  if (low < high) {
    // 获取分区点
    let pi = partition(arr, low, high);
    // 递归处理左侧
    quickSort(arr, low, pi - 1);
    // 递归处理右侧
    quickSort(arr, pi + 1, high);
  }
}

def quick_sort(arr, low, high):
    if low < high:
        # 获取分区点
        pi = partition(arr, low, high)
        # 递归处理左侧
        quick_sort(arr, low, pi - 1)
        # 递归处理右侧
        quick_sort(arr, pi + 1, high)