数据结构与算法_二分查找

#include<iostream>
using namespace std;

int BinarySearch(int *array, int len, int k)
{
	int low = 0, high = len - 1, mid = 0;
	
	while(low <= high)
	{
		mid = (low + high)/2;
		if(array[mid] == k)
		{
			return mid;
		}
		else if(array[mid] < k)
		{
			low = mid + 1;
		}
		else if(array[mid] > k)
		{
			high = mid - 1;
		}
	}
	return -1;

}


int main()
{
	int array[] = {1, 2, 3 ,4, 5, 6, 7, 8} ;
	int num = 7;
	int ret = BinarySearch(array, 8, num);
	if(ret == -1)
		cout << "没有找到" << endl;
	else 
	{
			cout << "在array["<<ret<<"]里找到" <<  num << endl; 
	} 
	
	return 0;
}