用Java编写快速排序
时间: 2023-05-26 13:02:57 浏览: 39
public class QuickSort {
public static void quickSort(int[] arr, int low, int high){
if(low < high) {
int pi = partition(arr, low, high);
quickSort(arr, low, pi - 1);
quickSort(arr, pi + 1, high);
}
}
private static int partition(int[] arr, int low, int high){
int pivot = arr[high];
int i = low - 1;
for(int j = low; j < high; j++) {
if(arr[j] <= pivot) {
i++;
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
int temp = arr[i + 1];
arr[i + 1] = arr[high];
arr[high] = temp;
return i + 1;
}
public static void main(String[] args) {
int[] arr = {5, 7, 9, 3, 1, 4, 6, 8, 2};
quickSort(arr, 0, arr.length - 1);
for(int i: arr) {
System.out.print(i + " ");
}
}
}