快速排序

	public static void quick(int[] nums,int left,int right){
		if(left>=right) return;
		int i=left;
		int j=right;
		int pivot = nums[left];
		while(i<j) {
			while(i<j && nums[j]>=pivot)
				j--;	
			if(i<j)
			nums[i++] = nums[j];
			while(i<j && nums[i]<pivot)
				i++	;	
			if(i<j)
			nums[j--] = nums[i];			
		}
		nums[i] = pivot;
		quick(nums, left, i-1);
		quick(nums, i+1, right);
		
	}