【算法】——快速排序

package com.xiaozhi.shuju;
/*
 * @author jingtianxiaozhi
 */
public class Test {
	public static void main(String[] args) {
		int a[]={51,33,62,96,87,17,28,51};
//		int a[]={46,58,15,45,90,18,10,62};
		quickSort(a,0,a.length-1);
		for(int k=0;k<a.length;k++)
			System.out.println(a[k]);
		
	}

	private static void quickSort(int[] a,int i,int j) {
		if(i>=j) return;
		int start=i;
		int length=j-i+1;
		int mark=a[i];
		while(j>i)
		{
			for(;j>i;j--)
			{
				if(a[j]<mark)
				{
					int temp=a[i];
					a[i]=a[j];
					a[j]=temp;
					break;
				}
			}//0 6、2 5、3 3//0 2、1 1
			for(;j>i;i++)
			{
				if(a[i]>mark)
				{
					int temp=a[i];
					a[i]=a[j];
					a[j]=temp;
					break;
				}
			}//2 6、3 5//1 2
		}
		quickSort(a, start, i-1);//1 6
		quickSort(a, i+1,start+length-1);
	}
}