二分法查找一个数字

#include<iostream> 
using namespace std;
int BinarySearch(int *p,const int x,const int n)
{ 
 	int left=0,right=n-1; 
 	while(left<=right) 
 	{  
 	 	int middle=(left+right)/2;  
  		if(x<p[middle])  
  		{   
   			right=middle-1;  
  		}  
  		else if(x>p[middle])  
  		{   
   			left=middle+1;  
  		}  
  		else  
  		{   
   			return middle;  
  		} 
 	} 
 	return -1;
} 
int main()
{ 
 	int a[11] = { 1, 3, 4, 6, 7, 9, 10, 16, 18, 25, 33 };
 	int y=10; 
 	int ret=BinarySearch(a,y,11); 
 	if(-1==ret) 
	 {  
  		cout<<y<<" 不存在！"<<endl; 
 	} 
 	else 
 	{  
 		 cout<<y<<"的下标是： "<<ret<<endl; 
 	} 
 	return 0;
}