二分查找
基本思想:在有序表中,取中间记录作为比较对象,若给定值与中间记录的关键码相等,则查找成功,若小于关键码,则在左半区继续查找,反之,在右半区继续查找。
优点:优点是比较次数少,查找速度快,平均性能好
缺点:其缺点是要求待查表为有序表,且插入删除困难
假设其数组长度为n,其算法复杂度为o(log(n))
代码如下:
参考:http://www.cnblogs.com/shuaiwhu/archive/2011/04/15/2065062.html
#include <iostream>
using namespace std;
//二分查找
int binary_search(int* a, int len, int goal);
int main()
{
const int LEN = 10000;
int a[LEN];
for(int i = 0; i < LEN; i++)
a[i] = i - 5000;
int goal = 0;
int index = binary_search(a, LEN, goal);
if(index != -1)
cout<<goal<<"在数组中的下标为"<<binary_search(a, LEN, goal)<<endl;
else
cout<<"不存在"<<goal<<endl;
return 0;
}
int binary_search(int* a, int len, int goal)
{
int low = 0;
int high = len - 1;
while(low <= high)
{
int middle = (low + high)/2;
if(a[middle] == goal)
return middle;
//在左半边
else if(a[middle] > goal)
high = middle - 1;
//在右半边
else
low = middle + 1;
}
//没找到
return -1;
}