二分查找

#include <iostream>
using namespace std;

template <typename T>

T bSearch(T a[],int n,T s)
{
 int mid;
 int left=0;
 int right=n-1;
 while (left<=right)
 {
  mid=(left+right)/2;
  if (a[mid]==s)
  {
   return mid;
  }
  else if (a[mid]>s)
  {
   right=mid-1;
  }
  else
  {
   left=mid+1;
  }
 }
 return (-1);
}
int _tmain(int argc, _TCHAR* argv[])
{
 int a[5]={1,2,3,4,5};
 int f=bSearch(a,5,5);
 if ((-1)==f)
 {
  cout<<"failure "<<endl;
 }
 else
 {
  cout<<"success"<<endl;
 }
 return 0;
}