思路
- 假设表中元素是按升序排列,将 表中间位置记录的关键字 与 查找关键字 比较,如果两者相等,则查找成功;否则利用中间位置记录将表 分成前、后两个子表 ,如果中间位置记录的关键字大于查找关键字,则进一步查找前一子表,否则进一步查找后一子表。重复以上过程,直到找到满足条件的记录,使查找成功,或直到子表不存在为止,此时查找不成功。
- 数据必须采用顺序存储结构,而且表中元素按关键字有序排列
迭代实现的代码
#include <iostream>
using namespace std;
int BinSearch(int *list, int n, int x);
int main(){
int a[] = {0,1,2,3,4,5,6,7,8,9};
int len = sizeof(a)/ sizeof(a[0]);
int result;
int num = 4;
result = BinSearch(a, len, num);
cout << result << endl;
return 0;
}
int BinSearch(int *list, int n, int x){
int low, mid, high;
low = 0, high = n-1;
while(low<=high){
mid = (low+high)/2;
if (x == list[mid]){
return mid;
}
else if (list[mid]>x){
high = mid-1;
}
else if (list[mid]<x){
low = mid+1;
}
}
return -1;
}
// 输出
// 4
递归实现的代码
#include <iostream>
using namespace std;
int BinSearch(const int *list, int x, int low, int high);
int main(){
int a[] = {0,1,2,3,4,5,6,7,8,9};
int len = sizeof(a)/ sizeof(a[0]);
int result;
result = BinSearch(a, 3, 0, len);
cout << result << endl;
return 0;
}
int BinSearch(const int *list, int x, int low, int high) {
if (low <= high) {
int mid = (low + high) / 2;
if (x < list[mid])
return BinSearch(list, x, low, mid - 1);
else if (x > list[mid])
return BinSearch(list, x, mid + 1, high);
else
return mid;
}
}
// 输出
// 4