二分搜索技术

vvssee

已于 2024-05-24 20:06:25 修改

阅读量164

点赞数 2

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

于 2024-05-24 20:05:29 首次发布

本文链接：https://blog.csdn.net/qq_74256533/article/details/139183402

版权

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

23 篇文章 0 订阅

订阅专栏

非递归算法;

#include<iostream>
using namespace std;
int BinarySearch(int a[],int x,int n)
{
    int right=0,left=n-1;
    while(right<=left)
    {
        int mid=(right+left)/2;
        if(x<a[mid])
            left=mid-1;
        else if(x>a[mid])
            right=mid+1;
        else
            return mid;
    }
    return -1;
}
int main()
{
    int a[]={0,1,2,3,4,5,6,7,8,9};
    int x;cin>>x;
    cout<<BinarySearch(a,x,10);
    return 0;
}

递归算法;

#include<iostream>
using namespace std;
int BinarySearch(int a[],int x,int right,int left)
{
    if(right<=left)
    {
        int mid=(right+left)/2;
        if(x<a[mid])
            return BinarySearch(a,x,right,mid-1);
        else if(x>a[mid])
            return BinarySearch(a,x,mid+1,left);
        else
            return mid;
    }
    return -1;
}
int main()
{
    int a[]={0,1,2,3,4,5,6,7,8,9};
    int x;cin>>x;
    cout<<BinarySearch(a,x,0,9);
    return 0;
}