C/C++程序设计与算法第十一周：二分查找

二分查找的实现

#include<iostream>
using namespace std;
int binarysearch(int a[],int size,int aim){
    int L = 0;
	int R = size - 1;
	while(L <= R){
	    int mid = L + (R - L)/2;
		if(a[mid] == aim)
		   return mid;
	    else if( aim > a[mid])
		   L = mid + 1;
		else if(aim < a[mid])
		   R = mid - 1;
	}
	return -1;
}

int main(){
   int test[] = {1,3,5,7,9,11};  // 有序数组
   int input;
   cin >> input;
   int target = binarysearch(test,sizeof(test)/sizeof(int),input);
   if(target != -1 )
     cout<<"存在" << test[target] <<endl;
   else
     cout<< "不存在"<<endl;
   return 0;
}