首先将给定值key与字典中间位置上元素的关键码(key)比较,如果相等,则检索成功;
否则,若key小,则在字典前半部分中继续进行二分法检索;
若key大,则在字典后半部分中继续进行二分法检索。
这样,经过一次比较就缩小一半的检索区间,如此进行下去,直到检索成功或检索失败。
偶数个取中间2个其中任何一个作为中间元素
int
BinarySearch(int low,int high,int
searchValue){
int mid;
if (high < low)
return -1;
mid = (low + high) >> 1; // Or mid = low + ((high - low) / 2)
if (a [mid] > searchValue)
{
return BinarySearch (a, low, mid, searchValue);
}
else if (a [mid] < searchValue)
{
return BinarySearch (a, mid + 1, high, searchValue);
}
else //when a[mid] is the search value..
{
return mid;
}
}
int binary_search( int *a, int n, int key )
{
int mid, front=0, back=n-1;
while (front<=back)
{
mid = (front+back)/2;
if (a[mid]==key)
return mid;
if (a[mid]<key)
front = mid+1;
else back = mid-1;
}
return -1;
}