二分搜索
#include <iostream>
using namespace std;
template <class Type>
int BinarySearch(Type a[],const Type&x,int n);
int main()
{
int x = 6;
int a[10];
for(int i=0; i<10; i++)
{
a[i] = i + 1;
}
cout<<BinarySearch(a,x,10)<<endl;
return 0;
}
template<class Type>
int BinarySearch(Type a[],const Type&x,int n)
{
int left = 0; int right = n-1;
while(left <= right