#include <iostream>
using namespace std;
#define MaxNum 10
int MidSearch(int data[], int k) {
int low = 0;
int high = MaxNum - 1;
int mid;
while (low <= high) {
mid = (low + high) >> 1;
if (data[mid] == k) {
return mid;
} else {
if (data[mid] > k) {
high = mid - 1;
} else {
low = mid + 1;
}
}
}
return -1;
}
int main() {
int data[MaxNum] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
cout << MidSearch(data, 90) << endl;
return 0;
}
C++实现折半查找
最新推荐文章于 2024-07-23 20:56:47 发布