寻找K最小

#include "iostream" using namespace std; void swap(int &a,int &b) { int temp=a; a=b; b=temp; } int rand_part(int *A,int low,int high) { int key=A[low]; int pivotpos=low; for (int i=low;i<=high;i++){ if (A[i]=q)return A[p]; int index=rand_part(A,p,q); int k=index-p; if (i-1==k){ return A[index]; } if(i-1<k){ return rand_search(A,p,index-1,i); }else{ return rand_search(A,index+1,q,i-k-1); } } void quick_sort(int *A,int p,int r) { if (p<r) { int q=rand_part(A,p,r); quick_sort(A,p,q-1); quick_sort(A,q+1,r); } } const int N=10; int main() { int A[N]={ 100, 200, 50, 23, 300, 560, 789, 456, 123, 258 }; cout<<endl; int result=rand_search(A,0,N-1,6); cout<<result<<endl; for (int i=0;i<N;i++){ cout<<" "<