二分查找法

/*****************************************
 * 文件名:Bsearch.cpp
 * 功能:二分查找法
 * 创建日期:2007-9-25
*****************************************/

#include <iostream>
using namespace std;

int Bsearch(int arrar[], int low, int hight, int v)
{
      int mid;

      while( low <= hight )
      {
            mid = ( low + hight ) / 2;
            if( v == arrar[mid] )
                  return mid;
            else if( v > arrar[mid] )
                  low = mid + 1;
            else
                  hight = mid - 1;

      }

      return -1;
}

int main()
{
      int ar[] = { 4, 3, 7, 8, 14, 15  }; // 升序排列好了
      int len = sizeof( ar ) / sizeof( ar[0] );

      cout << Bsearch(ar, 0, len - 1, 15) << endl;

      return 0;
}