【排序算法】——快速排序

package Sort;
public class QuickSort {
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int array[] = {9,7,4,23,5,7,0,12,67,11,5};
		for(int i : array){
			System.out.print(" "+i);
		}		
		System.out.println("排序后");
		quickSort(array,0,array.length-1);		
		for(int i : array){
			System.out.print(" "+i);
		}		
	}
	
	public static void quickSort(int[] array,int beg,int end){	
		if(beg < end){
			int mid = getMid(array, beg, end);
			quickSort(array,beg,mid-1);
			quickSort(array, mid+1, end);
		}		
	}	
	public static int getMid(int[] array,int beg,int end){
		int flag = array[beg];
		while(beg < end){
			while(beg < end && array[end]>=flag){
				end--;
			}
			array[beg] = array[end]; 
			while(beg < end && array[beg]<=flag){
				beg++;
			}
			array[end] = array[beg];						
		}			
	 	array[beg] = flag;
	 	return beg;		
	}
}