需求分析:
编写程序实现二分查找,顺序查找是对数组元素从头到尾的遍历,一旦数组元素很大,其查找效率就不高。二分查找是查找效率较高的一种,但前提是数组元素必须是有序的
输入格式:
输入要查找的整数x
输出格式:
如果找到数组的值与x值相等,则输出其对应的下标
否则输出“Not Found”、
输入输出样例1:
Enter x:8
Index is 7
输入输出样例2:
Enter x:71
Not Found
#include<stdio.h>
int Bsearch(int* p, int n, int x); //函数声明
int main()
{
int a[10] = { 1,2,3,4,5,6,7,8,9,10 };
int m, x;
printf("Enter x:");
scanf_s("%d", &x);
m = Bsearch(a, 10, x);
if (m >= 0)
printf("Index is %d\n", m);
else
printf("Not Found\n");
return 0;
}
int Bsearch(int* p, int n, int x) {
int low = 0, high = n - 1,mid; //通过mid改变low high的值来进行区间划分并进行查找
while (low <= high) {
mid = (low + high) / 2;
if (x == p[mid])
break;
else if (x < p[mid])
high = mid - 1; //前半段 high前移
else
low = mid + 1; //后半段 low后移
}
if (low <= high)
return mid;
else
return -1;
}