写一个 java快排
时间: 2023-03-01 18:32:59 浏览: 65
Java快速排序的实现如下:
```
import java.util.Arrays;
public class QuickSort {
public static void sort(int[] arr, int low, int high) {
if (arr == null || arr.length == 0)
return;
if (low >= high)
return;
// pick the pivot
int middle = low + (high - low) / 2;
int pivot = arr[middle];
// make left < pivot and right > pivot
int i = low, j = high;
while (i <= j) {
while (arr[i] < pivot) {
i++;
}
while (arr[j] > pivot) {
j--;
}
if (i <= j) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
i++;
j--;
}
}
// recursively sort two sub parts
if (low < j)
sort(arr, low, j);
if (high > i)
sort(arr, i, high);
}
public static void main(String[] args) {
int[] arr = {9, 8, 7, 6, 5, 4, 3, 2, 1};
QuickSort.sort(arr, 0, arr.length - 1);
System.out.println(Arrays.toString(arr));
}
}
```
该代码实现了快速排序的算法,并通过调用 `sort` 方法对数组进行排序。