5.2
编写折半查找函数,函数原型:int Binserach(int *a,int n,int key);
功能:在n个元素的数组a中寻找key,若找到则返回key在数组中的下标,否则返回-1。
已知有排好序的整数数组:
int a[]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
在main函数中,使用折半查找函数,输入一个整数,查找是否在数组中,如在给出下标,否则-1
输入:
9
输出:
8
样例输入:
9
样例输出:
8
#include<stdio.h>
int Binserach(int *a, int n, int key);
int main()
{
int a[] = { 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15 }; int key;
scanf("%d", &key);
int k = Binserach(a, 15, key);
if (k > 0)
printf("%d", k);
else
printf("-1");
system("pause");
return 0;
}
int Binserach(int *a, int n, int key)
{
int low = 0, high = n - 1;
while (low <= high)
{
int mid = (low + high) / 2;
if (key == a[mid])
return mid;
else
if (key < a[mid])
high = mid - 1;
else
low = mid + 1;
}
return -1;
}