快速排序学习 以数组中间值为轴

public static void main(String[] args) {
		int[] arrs = {15,13,17,19,6,34,9,55,9,3242,4};
		quickSearch(arrs,0,arrs.length-1);
		for (int i : arrs) {
			System.out.println(i);
		}
	}


	private static void quickSearch(int[] arrs, int left, int right) {
		// TODO Auto-generated method stub
		if(left<right){//首先判断角标是否越界
			int cen = arrs[(left+right)/2];//用变量将中间值记录下来，不记录下来会使中间值在下面代码执行过程中发生改变，因为数组在下面发生了重排，这时再取值就不准了
			int i = left-1;
			int j = right+1;
			while(true){
				while(arrs[++i]<cen);
				while(arrs[--j]> cen);
				if(i>=j)
					break;
				swap(arrs, i, j);
			}
			quickSearch(arrs,left,i-1);
			quickSearch(arrs,j+1,right);
		}
	}


	private static void swap(int[] arrs, int i, int j) {
		// TODO Auto-generated method stub
		int temp= 0;
		temp = arrs[i];
		arrs[i]= arrs[j];
		arrs[j]=temp;
	}