基础编程题目集 6-13 折半查找 (15分)

最新推荐文章于 2022-07-21 18:04:29 发布

Mo*◑

最新推荐文章于 2022-07-21 18:04:29 发布

阅读量293

点赞数 1

分类专栏： # 基础编程文章标签： c++

本文链接：https://blog.csdn.net/qq_44458489/article/details/105522977

版权

基础编程专栏收录该内容

46 篇文章 3 订阅

订阅专栏

在这里插入图片描述
題解：二分

#include <iostream>
using namespace std;
#define MAXSIZE 50
typedef int KeyType;
typedef struct
{
    KeyType key;
} ElemType;
typedef struct
{
    ElemType *R;
    int length;
} SSTable;
void Create(SSTable &T)
{
    int i;
    T.R = new ElemType[MAXSIZE + 1];
    cin >> T.length;
    for (i = 1; i <= T.length; i++)
        cin >> T.R[i].key;
}
int Search_Bin(SSTable T, KeyType k);
int main()
{
    SSTable T;
    KeyType k;
    Create(T);
    cin >> k;
    int pos = Search_Bin(T, k);
    if (pos == 0)
        cout << "NOT FOUND" << endl;
    else
        cout << pos << endl;
    return 0;
}
int Search_Bin(SSTable T, KeyType k)
{
    int left = 1;
    int right = T.length;
    int mid = 1;
    bool flag = false;
    while (left < right)
    {
        mid = (left + right) / 2;
        if (T.R[mid].key == k)
        {
            flag = true;
            break;
        }
        if (T.R[mid].key > k)
        {
            right = mid - 1;
        }
        else
        {
            left = mid + 1;
        }
    }
    if (flag)
    {
        return mid;
    }
    else
    {
        return 0;
    }
}