二分法查找C++实现

最新推荐文章于 2024-08-17 20:04:47 发布

wondergong

最新推荐文章于 2024-08-17 20:04:47 发布

阅读量1.7w

点赞数 2

分类专栏：数据结构与算法文章标签：二分法查找

本文链接：https://blog.csdn.net/qq_16209077/article/details/52681168

版权

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

11 篇文章 0 订阅

订阅专栏

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

int binary_seacher(vector<int> &v, int target)
{
    if (v.empty())
        return -1;

    int index1 = 0, index2 = v.size() - 1, mid = 0;

    while (index1 <= index2)
    {
        mid = (index1 + index2) / 2;
        if (v[mid] == target)
            return mid;

        if (v[mid] > target)
            index2 = mid-1;
        if (v[mid] < target)
            index1 = mid+1;
    }

    return -1;
}

int main()
{
    int n = 0, target = 0;

    cin >> n >> target;
    vector<int> v(n);

    for (int i = 0; i < n; i++)
    {
        cin >> v[i];
    }

    cout << binary_seacher(v, target);

    system("pause");
    return 0;
}