查找算法笔记

最新推荐文章于 2024-07-06 22:51:12 发布

VCDI

最新推荐文章于 2024-07-06 22:51:12 发布

阅读量95

点赞数

分类专栏：数据结构于算法

本文链接：https://blog.csdn.net/qq_27011361/article/details/101150955

版权

数据结构于算法专栏收录该内容

19 篇文章 1 订阅

订阅专栏

一、折半查找

1.迭代折半查找

#include <iostream>

using namespace std;

// return the position of array
int Binary_Search(int *a, const int x, const int n)
{
    int left = 0, right = n - 1;

    while (left <= right)
    {
        int mid = left + right >> 1;
        if (x < a[mid]) right = mid - 1;
        else if (x > a[mid]) left = mid + 1;
        else    return mid;
    }
    return -1;
}

int main()
{
    int a[] = {1,2,3,4,5,6,7,8,9};
    cout << Binary_Search(a,7,9);
    return 0;
}

2.递归折半查找

#include <iostream>

using namespace std;

// return the position of array
int Binary_Search(int *a, const int x, const int left, const int right)
{
    int mid = (left + right >> 1);
    if (left < right)
    {
        if (x < a[mid])
            return Binary_Search(a, x, left, mid - 1);
        else if(x > a[mid])
            return Binary_Search(a, x, mid + 1, right);
        else
            return mid;
    }
    return -1;
}

int main()
{
    int a[] = {1,2,3,4,5,6,7,8,9};
    cout << Binary_Search(a,7,0,8);
    return 0;
}