|
|
发表于 2020-11-28 22:41:15
|
显示全部楼层
本楼为最佳答案
你的问题已经解决,看注释
- #define M 10
- #include <stdio.h>
- int main(void)
- {
- static int a[M] = { -12,0,6,16,23,56,80,100,110,115 };
- int n, ret, low, mid, high, found;
- low = 0;
- high = M - 1;
- found = 0;
- printf("Input a number to be searched:");
- do // 使用 do ... while 语句,先执行一次 scanf()
- {
- ret = scanf("%d", &n); // 将 scanf() 函数的返回值赋给整型变量 ret
- if(ret != 1)
- printf("Illegal input!!\nPlease input agin!!\n");
- getchar(); // 吸收掉输入的错误字符,否则程序将死循环
- } while (ret != 1);
-
- while (low <= high)
- {
- mid = (low + high) / 2;
- if (n == a[mid])
- {
- found = 1; break;
- }
- else if (n > a[mid])
- {
- low = mid;
- }
- else
- {
- high = mid;
- }
- }
- if (found == 1)
- {
- printf("有这个数并且在第%d项", mid + 1);
- }
- else
- {
- printf("there is no %d", n);
- }
- }
复制代码 |
|