折半查找的c语言算法程序: int Search Bin( SSTable Sti, int n, int key Rint low, high, mid; low=l: high=n: while(low<=high) i mid=(lowthigh)/2; if( TIMid. key==key) return(mid;查找成功 else if((key< TIMid]. key)high=mid-1;/在前半区间继续查找* else ow=mid+l /在后半区间继续查找* return(O); 查找不成功*折半查找的c语言算法程序： int Search_Bin( SSTable ST[ ], int n, int key) {int low, high,mid; low=1; high=n; while(low<=high) { mid=(low+high)/2; if(ST[mid].key= = key) return (mid); /*查找成功*/ else if( key< ST[mid].key) high=mid-1; /*在前半区间继续查找*/ else low=mid+1; /*在后半区间继续查找*/ } return (0); /*查找不成功*/ }