typedef struct
{
ElemType *elem; //存储空间基址,建表时分配,0号位留出
int length;
}table;
int Search(int left, int right, int k, table t)
{
if(left > right) return -1;
int mid = (left + right) / 2;
if(k == t.elem[mid])
{
return mid;
}
else if(k > t.elem[mid])
{
Search(mid+1, right, k, t);
}
else
{
Search(left, mid-1, k, t);
}
}
二分查找的递归算法
最新推荐文章于 2022-03-18 10:32:09 发布