/*折半查找的前提条件是数组中的元素是顺序的,即数组元素须按值升序排列或降序排列*/
#include <iostream> //折半查找的函数实现
using namespace std;
int search(int array[],int n,int key)
{
int mid,low=0,high=n-1; //定义初始位置和结束为止并初始化
while(low<=high) //开始折半查找
{
mid=(low+high)/2; //获取中间位置
if(array[mid]==key)
{
cout<<"关键字所在的位置为:"<<mid+1<<endl;
break;
}
else
{
if(key<array[mid]) //变化low值和high的值
high=mid-1;
else
low=mid+1;
}
if(low>high)
cout<<"查找失败"<<endl;
}
}
int main()
{
int array[10]={1,2,3,4,5,6,7,8,9,10};
int key;
cout<<"请输入要查的关键字:"<<endl;
cin>>key;
search(array,10,key);
return 0;
#include <iostream> //折半查找的函数实现
using namespace std;
int search(int array[],int n,int key)
{
int mid,low=0,high=n-1; //定义初始位置和结束为止并初始化
while(low<=high) //开始折半查找
{
mid=(low+high)/2; //获取中间位置
if(array[mid]==key)
{
cout<<"关键字所在的位置为:"<<mid+1<<endl;
break;
}
else
{
if(key<array[mid]) //变化low值和high的值
high=mid-1;
else
low=mid+1;
}
if(low>high)
cout<<"查找失败"<<endl;
}
}
int main()
{
int array[10]={1,2,3,4,5,6,7,8,9,10};
int key;
cout<<"请输入要查的关键字:"<<endl;
cin>>key;
search(array,10,key);
return 0;
}