快排之标准实现

public class Main {/** * @param args */public static void main(String[] args) {// TODO Auto-generated method stubint[] array = new int[] {2, 3, 1, 5, 4};quickSort(array, 0, array.length - 1);for (int i = 0; i < array.length; i++) {System.out.println(array[i]);}}public static void quickSort(int[] array, int left, int right) {if (left < right) {int index = partion(array, left, right);quickSort(array, left, index - 1);quickSort(array, index + 1, right);}}private static int partion(int[] array, int left, int right) {int pivot = array[left];int i = left + 1;int j = right;while (i <= j) {while (i <= j && array[i] < pivot) {++i;}while (j >= i && array[j] > pivot) {--j;}if (i <= j) {swap(array, i, j);++i;--j;}}swap(array, left, j);return j;}private static void swap(int[] array, int i, int j) {if (i != j) {int temp = array[i];array[i] = array[j];array[j] = temp;}}}