#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
using namespace std;
int main() {
int a;
int arr[10000];
cin >> a;
int i = 0;
while (a != 0) {
arr[i] = a;
cin >> a;
i++;
}
for (int j = 0; j < i; j++) {
for (int k = 0; k < i - j - 1; k++) {
if (arr[k] > arr[k + 1]) {
int temp;
temp = arr[k];
arr[k] = arr[k + 1];
arr[k + 1] = temp;
}
}
}
int flag = 0, j = 0;
int times = 0;
cin >> a;
while (flag == 0 && j <= i) {
times++;
int mid = (i + j) / 2;
if (arr[mid] == a) {
flag = 1;
cout << mid + 1<< " " << times << endl;
}
else {
if (arr[mid] > a) {
i = mid - 1;
}
else {
j = mid + 1;
}
}
}
if (flag == 0) {
cout << 0 << " " << times << endl;
}
return 0;
}
【7083】试编写有序表折半查找算法
最新推荐文章于 2023-04-22 20:29:07 发布