折半查找

折半查找也叫二分查找，是很快的查找方式，使用普遍，前提是数据先进行排序，比如以下例子中用到的数组就是拍好序的int arr[]={1,2,3,4,5,6,7,8,9,10};

#include <iostream>

using namespace std;
int binSearch(int x,int a[],int n);
void main()
{

int arr[]={1,2,3,4,5,6,7,8,9,10};
int num;
num=9;
int result;
result=binSearch(num,arr,10);

if(result>=0)
{
printf("在arr[%d]中找到%d\n",result,num);
cout<<"在arr["<<result<<"]中找到"<<num<<endl;//c++输出格式
}

}
int binSearch(int x,int a[],int n)
{

int low ,high,mid;
low=0;
high=n-1;

while(low<=high)
{

mid=(low+high)/2;

if(x<a[mid])

{

high=mid-1;

}

else if(x>a[mid])

{

low=mid+1;

}

else

return mid;

}
return -1;

}