快速排序:
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
![](https://images.cnblogs.com/OutliningIndicators/ExpandedBlockStart.gif)
void quick_sort(int* A, int x, int y) { if(y - x <= 1) return; // 2 numbers at least int base = A[x]; int p = x + 1, q = y - 1; while(p < q){ while(p < q && A[q] >= base) q--; // only > is wrong, which result that q and p won't be changed, so dead loop while(p < q && A[p] < base) p++; swap(A[p], A[q]); } if(A[p] < A[x]) swap(A[x], A[p]); quick_sort(A, x, p); quick_sort(A, p, y); }
注意点:
0. 传递左闭右开区间。
1. 返回条件:数目小于1直接退出——if(y - x <= 1) return;
2. 以首元素作为基准,先从右至左,再从左至右。
3. 务必注意:向左走的条件必须包括==base, 否则将因为走不动而导致q, p无变化,导致死循环。
找到第k大的数字
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
![](https://images.cnblogs.com/OutliningIndicators/ExpandedBlockStart.gif)
int find_kth_number(int* A, int x, int y, int k) { if(y - x == 1) return A[x]; if(y - x < 1) return -1; int base = A[x]; int p = x + 1, q = y - 1; while(p < q){ while(p < q && A[q] >= base) q--; while(p < q && A[p] < base) p++; swap(A[p], A[q]); } if(A[p] < A[x]) swap(A[x], A[p]); if(p - 1 == k){ //一开始用了p和k坐比较,殊不知其实是左闭右开区间,即整个数组分成了x...p-1 p...y-1。一句话,分清界限 return A[x]; }else if(p - 1 < k){ return find_kth_number(A, p, y, k); }else{ return find_kth_number(A, x, p, k); } }