#include <stdio.h>
int zheban(int s[], int low, int high, int num) {
int mid = (low + high) / 2;
if (low > high)
return -1;
else {
if (s[mid] == num)
return mid;
else if (s[mid] < num)
return zheban(s, mid + 1, high, num);
else
return zheban(s, low, mid - 1, num);
}
}
int main() {
int a[100];
int n, num, result;
printf("输入要创建数组元素的个数\n")
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
printf("输入要查询的元素:\n");
scanf("%d", &num);
result = zheban(a, 0, n - 1, num);
if (-1 != result) {
printf("查找成功,%d在第%d个位置上", num, result + 1);
} else
printf("查找失败");
}