public class Main { public static void main(String[] args) { int[] q = new int[1000]; for (int i = 0; i < 1000; i++) { q[i] = (int) (Math.random() * 1000); } quick_sort(q, 0, 1000 - 1); for (int i = 0; i < 1000; i++) { System.out.print(q[i] + " "); } } private static void quick_sort(int[] q, int l, int r) { if (l >= r) return; int x = q[l], i = l - 1, j = r + 1; while (i < j) { do i++; while (q[i] < x); do j--; while (q[j] > x); if (i < j) { int t = q[i]; q[i] = q[j]; q[j] = t; } } quick_sort(q, l, j); quick_sort(q, j + 1, r); } }
Java快速排序模板
于 2024-03-22 22:32:05 首次发布