编写一个程序 实现一个数值数组

实现一个数值数组从大到小的排序函数 并调用函数对数组【9 -6 24 10 7 56 0】进行排序 在页面上输出结果为56 24 10 9 7 0 -6

 public static int partition(int[] arr, int low, int high) {
        int pivot = arr[low];
        while (low < high) {
            while (low < high && arr[high] < pivot) {
                --high;
            }
            arr[low] = arr[high];
            while (low < high && arr[low] >= pivot) {
                ++low;
            }
            arr[high] = arr[low];
        }
        arr[low] = pivot;
        return low;
    }

    public static void quickSort(int[] arr, int low, int high) {
        if (low < high) {
            int p = partition(arr, low, high);
            quickSort(arr, low, p - 1);
            quickSort(arr, p + 1, high);
        }
    }

function partition(arr, low, high) {
  let pivot = arr[low];
  while (low < high) {
    while (low < high && arr[high] < pivot) {
      --high;
    }
    arr[low] = arr[high];
    while (low < high && arr[low] >= pivot) {
      ++low;
    }
    arr[high] = arr[low];
  }
  arr[low] = pivot;
  return low;
}

function quickSort(arr, low, high) {
  if (low < high) {
    let pivot = partition(arr, low, high);
    quickSort(arr, low, pivot - 1);
    quickSort(arr, pivot + 1, high);
  }
  return arr;
}