Quick Sort的Java实现

public class QuickSort {private static void quickSort(int[] A, int start, int end) {if (start >= end)return;int pivot = A[start];int i = start, j = end;while (i < j) {while (j > i && A[j] >= pivot)j--;A[i] = A[j];while (i < j && A[i] < pivot)i++;A[j] = A[i];}A[i] = pivot;quickSort(A, start, i - 1);quickSort(A, i + 1, end);}public static void tester() {int[] A = new int[1000];for (int i = 0; i < 1000; ++i)A[i] = (int)(Math.random() * 1000);quickSort(A, 0, A.length - 1);for (int i = 0; i < 1000; ++i)System.out.print(A[i] + " ");}}