- 应当先从后向前搜索,再从前向后搜索
- 最后应当将两个指针相遇时指向的元素置为tem
public void fastSort(int[] nums,int l,int r){
if(l>=r) return;
int i = l;
int j = r;
int tem = nums[l];
while(i<j){
while(i<j&&nums[j]>tem){
j--;
}
if(i<j) nums[i++] = nums[j];
while(i<j&&nums[i]<=tem){
i++;
}
if(i<j) nums[j--] = nums[i];
}
nums[i] = tem;
fastSort(nums,l,i-1);
fastSort(nums,i+1,r);
}