[简答题]已知静态査找表顺序存储结构的类型定义如下：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 low，high;
    low=1; high = T.n;
    while(low〈= high){
        mid=(low+high)/2;
        if(key == T.elem[mid].key)return mid;
        else if(key < T.elem[mid].key)high = mid-1;
            else low=mid+1;
    }
    return 0;
}