tijie
2025-06-01 16:42:56
发布于:黑龙江
1阅读
0回复
0点赞
#include <bits/stdc++.h>
using namespace std;
int Search(int a[], int n, int key) {
int low = 1;
int high = n;
while (low <= high) {
int mid = low + ((high - low) / 2);
if (key == a[mid]) return mid;
else if (key < a[mid]) high = mid - 1;
else low = mid + 1;
}
return -1;
}
int main() {
int n, b;
cin >> n;
int s[n+1]={0};
for (int i = 1; i <= n; i++) {
cin >> s[i];
}
cin >> b;
cout << Search(s, n, b) << endl;
}
这里空空如也
有帮助,赞一个