清尘2010

摘要： 已知序列S=x1x2...xn以及整数K，k在1，n之间，查找S中第K小的数。int partion(int *a, int i, int j){ int pivot = a[i]; int l = i, r = j; int mid =0; while(l =pivot && r >= l){r++;} if(l = k) select(ary, i, mid, k); else select(ary, mid+1, j, k-(mid-i+1)); } } 阅读全文