java 快速排序

package sort;

import java.util.Arrays;

public class Quick {
	public static void sort(int [] a) {
		// 可以先shuffle数组，避免出现最坏的复杂度（n^2）/2，使排序时间可以得到估计
		sort(a, 0, a.length - 1);
	}

	private static void sort(int [] a, int lo, int hi) {
		// TODO Auto-generated method stub
		if (lo >= hi) {
			return;
		}
		int m = partition(a, lo, hi);
		sort(a,lo,m-1);
		sort(a,m+1,hi);
	}

	private static int partition(int [] a, int lo, int hi) {
		int i = lo;
		int j = hi + 1;
		int  v = a[lo];

		while (true) {
			while (a[++i] < v)  if (i == hi) break;
			while (a[--j] > v)  if (j == lo) break;
			if( i >= j){
				break;
			}
			swap(a,i,j);
		}
		swap(a,lo,j);
		return j;
	}

	private static void swap(int [] a, int i, int j) {
		int  t = a[i];
		a[i] = a[j];
		a[j] = t;
	}
	
	public static void main(String[] args) {
		int[] sample = new int[]{2,2,2,2,2,2,1,12,123,4,6,24,0,6};
		sort(sample);
		System.out.println(Arrays.toString(sample));
	}
}