【java】快速排序

public void quickSort(int[] nums,int left,int right) {
		if(left>=right) return;
		int key = nums[left];
		int i = left;
		int j = right;
		while(i<j) {
			if(nums[j]<key) {
				if(nums[i]>key) {
					int tmp = nums[i];
					nums[i] = nums[j];
					nums[j] = tmp;
				}else {
					i++;
				}
			}else {
				j--;
			}
		}
		int tmp = nums[left];
		nums[left] = nums[i];
		nums[i] = tmp;
		quickSort(nums,left,i-1);
		quickSort(nums,i+1,right);
		
	}