c++数据结构——递归的折半查找

[code]#include <iostream>
using namespace std;
int binarysearch_r(int *list, const int n, const int low, const int high);
int main()
{
int a[] = { 1,2,3,4,5,6,7,8,9,10 };
int b;
cout << "please enter a number:";
cin >> b;
int c = binarysearch_r(a, b,0,9);
if (c == -1)
cout << "没找到" << endl;
else
cout << "a[" << c<< "]=" << a[c] << endl;
return 0;
}
int binarysearch_r(int *list, const int x , const int low, const int high)        //递归的折半查找
{
if (low <= high)
{
int mid = (low + high) / 2;
if (list[mid] == x)
return mid;
else if (list[mid] < x)
return binarysearch_r(list, x, mid + 1, high);
else
return binarysearch_r(list, x, low, mid - 1);
}
return -1;
}