- 快排
public void quickSort(int left , int right, int []list){
if(left >= right){
return ;
}
int i, j ,t, temp;
temp = list[left];
i = left;
j = right;
while(i!= j){
// 以temp为基准 ,左右排开
while(list[j] >= temp && i < j){
j--;
}
while(list[i] <= temp && i < j){
i++;
}
if(i < j){
t = list[i];
list[i] = list[j];
list[j] = t;
}
}
list[left] = list[i];
list[i]= temp;
quickSort(left, i-1, list);
quickSort(i+1, right, list);
}