快速排序

public class Problem2 {
public static void main(String[] args) {
int[] a = { 23, 23, 34, 67, 12, 56 };
quickSort(a, 0, a.length - 1);
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
}

static void quickSort(int[] a, int left, int right) {
	if (left > right) {
		return;
	}
	int i = left;
	int j = right;
	int temp = a[left];
	while (i < j) {
		while (a[j] >= temp && i < j) {
			j--;
		}
		a[i] = a[j];
		while (a[i] <= temp && i < j) {
			i++;
		}
		a[j] = a[i];
	}
	a[i] = temp;
	quickSort(a, left, i-1);
	quickSort(a, i+1, right);
}

}