Re：从零开始的算法学习【1】二分法查找

#include<iostream>
#include<string>
using namespace std;


string search(int a[],int num)
{
	int low = 0;
	int high = sizeof(a)-1;
	while(low <= high)
	{
	int mid = (low + high)/2;
	int guess = a[mid];
	if(guess == num )
	{
		return  "找到了";
	}
	if(guess > num)
	{
		high = mid - 1;
	}else{
		low = mid +1;
	}
	
	}
	return "没有找到";
}


int main()
{
	int b;
	cin >> b;
	int a[] =  {1,3,5,7,9,11};
	cout << search(a,b) <<endl;
	
 }