将折半查找的算法改写成递归算法

int Search_Bin_Recursive(SSTable ST,int key,int low,int high)//折半查找的递归算法{ if(low>high) return 0;//查找不到时返回0 mid=(low+high)/2;if(ST.elem[mid].key==key) return mid;else if(ST.elem[mid].key>key) return Search_Bin_Recursive(ST,key,low,mid-1);else return Search_Bin_Recursive(ST,key,mid+1,high);}} 收起