第九章查找..docVIP

第九章 查找 9.25 int Search_Sq(SSTable ST,int key)//在有序表上顺序查找的算法,监视哨设在高下标端{??ST.elem[ST.length+1].key=key;??for(i=1;ST.elem[i].keykey;i++);??if(iST.length||ST.elem[i].keykey) return ERROR;??return i;}//Search_Sq分析:本算法查找成功情况下的平均查找长度为ST.length/2,不成功情况下为ST.length. 9.26 int Search_Bin_Recursive(SSTable ST,int key,int low,int high)//折半查找的递归算法{??if(lowhigh) return 0; //查找不到时返回0??mid=(low+high)/2;??if(ST.elem[mid].key==key) return mid;??else if(ST.elem[mid].keykey)????return Search_Bin_Recursive(ST,key,low,mid-1);??else return Search_Bin_Recursive(ST,key,mid+1,high);??}}//Search_Bin_Re