快排
private void QuickSort(List<int> list,int left,int right) { if(left<right) { int i = left; int j = right; int x = list[left]; int temp; while(i<j) { while(list[j]>=x&&i<j) j--; while(list[i]<=x&&i<j) i++; if(i<j) { temp = list[i]; list[i] = list[j]; list[j] = list[i]; } } list[left] = list[i]; list[i] = x; } QuickSort(list,left,i-1); QuickSort(list,i+1,right );
} }