//**********************************************************************//
// 刚刚申请的博客,第一篇就写个简单一点的,嘿嘿...... //
//**********************************************************************//
//时间2009.8.5
//内容:二分查找
int BinarySearch (int a[] , int head , int tail , int x)
{
if (head > tail)
return -1;
else
{
int middle = (head + tail) / 2;
if (x > a[middle])
BinarySearch (a, middle + 1, tail, x);
else if (x < a[middle])
BinarySearch (a, head, middle - 1, x);
else
return middle + 1;
}
}