快速排序是一种常用的排序算法,使用 Java 实现快速排序有以下几种方法:
递归方法 ``` public class QuickSort { public static void sort(int[] arr, int low, int high) { if (arr == null || arr.length == 0) return; if (low >= high) return; int middle = low + (high - low) / 2; int pivot = arr[middle]; 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--; } } 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}; sort(arr, 0, arr.length-1); for (int i : arr) { System.out.print(i + " "); } }
} ```