1.cpp

二分查找法的windows环境下用c++编程出来 绝对是初学者的福音

#include <iostream.h>
int BinSearch(int A[],int high,int key);
void main()
{
	int a[10]={-7,3,5,8,12,16,23,33,55,66};
	int key=2;
	int s=BinSearch(a,sizeof(a)/sizeof(a[0]),key);
	cout<<s<<endl;

}

int BinSearch(int A[],int high,int key)
{
	int mid;
	int low=0;
	while (low<=high)
	{
		mid=(low+high)/2;
		if (key==A[mid]) return mid;

		else if (key<A[mid])  
			high=mid-1;

		else if (key>A[mid])
		low=mid+1;		
	}
	return -1;
}