编写折半查找函数,函数原型: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
#include<stdio.h>
#include<string.h>
int Binsearch(int *a,int n,int key)
{
int low, mid, high;
low = 0;
high = n - 1;
while (low <= high)
{
mid = (low + high) / 2;
if (a[mid] == key)
{
return mid;
}
else if (a[mid] < key)
{
low = mid + 1;
}
else
{
high = mid - 1;
}
}
return -1;
}
int main()
{
int n,key,a[] = { 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15 };
n = 15;
scanf_s("%d", &key);
key = Binsearch(a, n, key);
printf("%d", key);
return 0;
}