java的快速排序怎么写
时间: 2023-03-06 17:26:23 浏览: 37
对于 Java 中的快速排序,您可以使用以下代码:public static int[] quickSort(int[] array) {
quickSort(array, 0, array.length - 1);
return array;
}public static void quickSort(int[] array, int left, int right) {
if (left < right) {
int pivot = partition(array, left, right);
quickSort(array, left, pivot - 1);
quickSort(array, pivot + 1, right);
}
}public static int partition(int[] array, int left, int right) {
int pivot = array[right];
int partitionIndex = left;
for (int i = left; i < right; i++) {
if (array[i] <= pivot) {
int tmp = array[i];
array[i] = array[partitionIndex];
array[partitionIndex] = tmp;
partitionIndex++;
}
}
int tmp = array[partitionIndex];
array[partitionIndex] = array[right];
array[right] = tmp;
return partitionIndex;
}