基本思想:二分查找,查找的数组须是一个排好序的数组,假设是升序。对于给定值x,从序列的中间位置开始比较,如果当前位置值等于x,则查找成功;若x小于当前位置值,则在数列的前半段中查找;若x大于当前位置值则在数列的后半段中继续查找,直到找到为止。
以下是模板的代码实现:
#include<cstdio>
#include<cstring>
#include<iostream>
#define N 500
using namespace std;
int BinarySearch(int a[], int n, int goal)
{
int left = 0, right = n-1;
int mid;
while(left <= right){
mid = (left+right)/2;
if(a[mid] == goal) break;
if(a[mid] > goal) right = mid-1;
else left = mid+1;
}
if(left > right) return -1;
else
return mid;
}
int main()
{
int n;
int b[N];
scanf("%d", &n);
for(int i = 0; i<n; i++)
scanf("%d", &b[i]);
int s = BinarySearch(b, 7,7);
if(s!= -1) printf("该位置是%d\n", s);
else printf("不存在该数!!!\n");
return 0;
}