请在 下方输入 要搜索的题目:

二分查找

二分查找

发布时间:2024-12-12 22:07:06
推荐参考答案 ( 由 快搜搜题库 官方老师解答 )
联系客服
答案:#include<stdio.h>Int main(int argc, char** argv){ int arr] = { 1,2,3,4,5,6,7,8,9,10 }; int left = 0; int right = (sizeof(arr) / sizeof(arr0]) - 1); int mid = (left + right) / 2; int search; scanf("%d", &search); while (left <= right) { if (arrmid] > search) { right = mid - 1; mid = (left + right) / 2; } else if (arrmid] < search) { left = mid + 1; mid = (left + right) / 2; } else { printf("找到了,下标为%d\n", mid); break; } } if (left > right) { printf("没找到\n"); } return 0;}
专业技术学习
专业技术学习
搜搜题库系统