最小的k个数-模版

原创于 2022-10-09 15:12:23 发布 · 108 阅读

CC 4.0 BY-SA版权

文章标签：

void SearchKth(int[]a,int k,int low,int high){
        int pivot=a[low];
        int l=low,r=high;
        while(low<high){    
            while(low<high&&a[high]>=pivot)--high;
            a[low]=a[high];
            while(low<high&&a[low]<=pivot)++low;
            a[high]=a[low];
        }
        a[low]=pivot;
        if(low==k) return ;
        else if(low>k) SearchKth(a,k,l,low-1);
        else SearchKth(a,k,low+1,r);
    }