折半查找递归

1613阅读　0评论2012-09-28　tansijie
分类：C/C++

点击(此处)折叠或打开

  1. int BinarySearch(int* _array,int left, int right, int e)
  2. {
  3.     int middle = (left+right)/2;

  5.     if(left > right)
  6.     {
  7.         return -1 ;
  8.     }
  9.     if(_array[middle] < e)
  10.     {
  11.         return BinarySearch(_array,middle,right,e);
  12.     }else if(_array[middle] == e)
  13.     {
  14.         return middle;
  15.     }
  16.     else
  17.     {
  18.         return BinarySearch(_array,left,middle,e);
  19.     }
  20.     return -1;
  21. }

上一篇：折半查找
下一篇：合并排序