#include<iostream>
using namespace std;
int main()
{
int bin_search(int *a, int y);
int a[6], i,x;
for (i = 0; i < 6; i++)
cin >> a[i];
cout << "please the key number:";
cin >> x;
if (bin_search(a, x))
cout << "这是第" << bin_search(a, x) << "个数" << endl;
else
cout << "NO finding!";
return 0;
}
int bin_search(int *b, int y)
{
int low=0, height=5;
while (low <= height)
{
int middle = (height+low)/2;
if (b[middle]==y)
{
return (middle + 1);
}
else if (b[middle]>y)
{
height = middle - 1;
}
else if(b[middle]<y)
{
low = middle + 1;
}
}
return -1;
}
折半查找法(二分法)
最新推荐文章于 2022-05-17 22:05:03 发布