#include<iostream>
using namespace std;
#define MAXSIZE 10
#define NotFound 0
typedef int ElementType;
typedef int Position;
typedef struct LNode* List;
struct LNode {
ElementType Data[MAXSIZE];
Position Last;
};
List ReadInput();
Position BinarySearch(List L, ElementType X);
int main() {
List L;
ElementType X;
Position P;
L = ReadInput();
cin >> X;
P = BinarySearch(L, X);
cout << P << endl;
return 0;
}
List ReadInput() {
int n;
cin >> n;
List L = (List)malloc(sizeof(struct LNode));
L->Last = n;
for (int i = 1; i <= n; i++) {
cin >> L->Data[i];
}
return L;
}
Position BinarySearch(List L, ElementType X) {
Position high = L->Last;
Position low = 1, mid;
while (low <= high) {
mid = (low + high) / 2;
if (X == L->Data[mid]) return mid;
else if (X < L->Data[mid]) high = mid - 1;
else low = mid + 1;
}
return NotFound;
}
函数题01 二分查找
最新推荐文章于 2022-02-28 11:40:12 发布
本文介绍如何使用C++编写一个二分查找函数,通过`ListReadInput`读取用户输入的有序列表,并在`BinarySearch`中应用该算法查找指定元素。重点在于理解输入处理和搜索策略在实际编程中的应用。
摘要由CSDN通过智能技术生成