C++二分检索算法

最新推荐文章于 2023-04-10 22:50:07 发布

小英雄Dui

最新推荐文章于 2023-04-10 22:50:07 发布

阅读量827

点赞数

分类专栏：算法文章标签：算法

本文链接：https://blog.csdn.net/ujsDui/article/details/79002716

版权

算法专栏收录该内容

17 篇文章 2 订阅

订阅专栏

余祥宣, 崔国华, 邹海明. 计算机算法基础.3版[M]. 华中科技大学出版社, 2006.
P73 算法4.3

#include<iostream>
using namespace std;

int BINSRCH(int A[], int n, int x, int &j)
{
    int low, high, mid;
    low = 1;
    high = n;
    while (low <= high)
    {
        mid = (low + high) / 2;
        if (x < A[mid])
            high = mid - 1;
        else if (x > A[mid])
            low = mid + 1;
        else
        {
            j = mid;
            return j;
        }
    }
    j = 0;
    return j;
}

int main()
{
    int a[10] = { 0,-15,-6,0,7,9,23,54,82,101 };
    int n = 9;
    int x = 101;
    int j = 0;
    for (int i = 1; i <= 9; i++)
    {
        cout << a[i] << " ";
    }
    cout << endl;
    cout << "BINSRCH(a," << n << "," << x << ",j)=" << BINSRCH(a, n, x, j);
    cout << " a[" << j << "]=" << a[j] << endl;

    x = -14;
    cout << "BINSRCH(a," << n << "," << x << ",j)=" << BINSRCH(a, n, x, j);
    cout << " a[" << j << "]=" << a[j] << endl;

    x = 82;
    cout << "BINSRCH(a," << n << "," << x << ",j)=" << BINSRCH(a, n, x, j);
    cout << " a[" << j << "]=" << a[j] << endl;

    system("pause");
    return 0;
}