【C++】线性时间选择

真的很拉风

已于 2023-12-30 23:18:52 修改

阅读量603

点赞数 16

分类专栏：算法设计与分析文章标签： c++ 算法数据结构

于 2023-12-30 21:25:12 首次发布

本文链接：https://blog.csdn.net/weixin_63160898/article/details/135309929

版权

算法设计与分析专栏收录该内容

8 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <vector>
using namespace std;

void swap(vector<int>& nums, int a, int b)
{
    int temp = nums[a];
    nums[a] = nums[b];
    nums[b] = temp;
}

int linear_select(vector<int>& nums, int begin, int end, int target)
{
    int i = begin;
    int j = end;
    int pivot = begin;

    while(i<j){
        while(i<j && nums[j]>=nums[pivot]){
            j--;
        }
        while(i<j && nums[i]<=nums[pivot]){
            i++;
        }
        swap(nums, i, j);
    }

    swap(nums, pivot, i);

    int order = i-begin+1;
    if(order==target){
        return nums[j];
    }
    else if(order < target){
        return linear_select(nums, j+1, end, target-order);
    }
    else{
        return linear_select(nums, begin, j-1, target);
    }
}


int main() {
    vector<int> array1 = {1,5,4,3,2,9,8,6,7,0};
    vector<int> array2 = {1,2,3,4,5,6,7,8,9,10};

    int ans1 = linear_select(array1, 0, array1.size()-1, 5);
    int ans2 = linear_select(array2, 0, array2.size()-1, 5);

    cout << ans1 << endl << ans2 << endl;

    return 0;
}