题目内容
(请给出正确答案)
[单选题]
试将折半查找的算法改写成递归算法。Intbisearch(sqlistL,intlow,inthigh,elemtypex){If(low>high)return(0);else{if(L.data[mid]==x)return(mid);elseif(L.data[mid]>x)bisearch(L,low,mid-1,x);elsebisearch(L,mid+1,high,x);}}//bisearch
A.mid<(low+high)/2
B.mid=(low+high)/2
C.mid>(low+high)/2;
D.mid!=(low+high);
如搜索结果不匹配,请 联系老师 获取答案