寻找第K大的数

最新推荐文章于 2022-01-12 14:56:48 发布

荷黍香

最新推荐文章于 2022-01-12 14:56:48 发布

阅读量421

点赞数

分类专栏：数据结构与算法 C/C++

本文链接：https://blog.youkuaiyun.com/xuchishao/article/details/44097135

版权

数据结构与算法同时被 2 个专栏收录

16 篇文章

订阅专栏

C/C++

6 篇文章

订阅专栏

#include<stdio.h>

int Kth_elem(int a[], int low, int high, int k)
{
    int pivot = a[low];
    int low_temp = low;
    int high_temp = high;

    while(low<high)
    {
        while(low<high && a[high]>=a[low])
            --high;
        a[low]=a[high];

        while(low<high && a[low]<=a[high])
            ++low;
        a[high]=a[low];

    }

    a[low]=pivot;

    if(low==k)
        return a[low];
    else if (low>k)
        return Kth_elem(a,low_temp,low-1,k);
    else
        return Kth_elem(a,low+1,high_temp,k);

}

int main()
{
    int data[10]={1,31,4,52,6,4,77,41,62,94};
    printf("%d ",Kth_elem(data,0,9,1));

}