二分查找代码

#include<iostream>  using namespace std; int BinarySearch(int a[],const int x,int n){ int left=0;int right=n-1;while(left<=right){int middle=(left+right)/2;if(x==a[middle]){ return middle;}if(x>a[middle]){left=middle+1;}else{right=middle-1;}}return -1;} int main(){ int a[10]={1,3,4,6,7,8,9,11,39,55};int result=BinarySearch(a,1,10);cout<<result;return 0; }