已知静态查找表顺序存储结构的类型定义如下：const int Maxsize=20;typedef struct{KeyType

已知静态查找表顺序存储结构的类型定义如下：
const int Maxsize=20;
typedef struct
{
KeyType key;
…
} TableElem;
typedef struct
{
TableElem elem[Maxsize+1];
int n;
}SqTable;
设计实现有序表二分查找算法SearchBin(SqTable T,KeyType key)（假定有序表是按键值从小到大有序）。
【正确答案】：【答案】
int SearchBin(SqTable T.KeyType key)
{
int 1lowhigh;
1ow=1;high=T.n;
while(1ow<=high)
{
mid=(1low+high)/2;
if(key==T.elem[mid].key) return mid;
else if(keyelse low=mid+1;
}
return 0;
}