C++算法(3) 折半查找

最新推荐文章于 2023-01-06 14:18:27 发布

二氧化硅

最新推荐文章于 2023-01-06 14:18:27 发布

阅读量160

点赞数

分类专栏： C++算法

本文链接：https://blog.csdn.net/weixin_42592666/article/details/103146220

版权

C++算法专栏收录该内容

12 篇文章 1 订阅

订阅专栏

    #include<iostream>

    using namespace std;

    int BinarySearch_I(int*, const int, const int); //线性查找
    int BinarySearch_R(int*, const int, const int, const int);  //迭代

    int main()
    {

        int num[] = {1, 3, 4, 12, 13, 24, 34};
        int num_i = 12;

        cout << BinarySearch_I(num, num_i, 7)<<endl;
        cout<<BinarySearch_R(num, num_i, 0, 6);

        return 0;
    }
    int BinarySearch_I(int*a, const int x, const int n)
    {
        int left = 0, right = n - 1;
        while(left <= right)
        {
            int mid = (left + right)/2;
            if(x < a[mid]) right =  mid - 1;
            else if(x > a[mid]) left = mid + 1;
            else return mid;
        }
        return -1;
    }
    int BinarySearch_R(int* a, const int x, const int left, const int right)
    {
        if(left <= right)
        {
            int mid = (left + right)/2;
            if(x <a[mid]) return BinarySearch_R(a, x, left, mid - 1);
            else if (x > a[mid]) return BinarySearch_R(a, x, mid + 1, right);
            else return mid;
        }
        return -1;

    }