给一个严格递增数列,函数int Search_Bin(SSTable T, KeyType k)用来二分地查找k在数列中的位置。
#include <iostream>
using namespace std;
#define MAXSIZE 50 typedef int KeyType;
typedef struct
{ KeyType key;
}ElemType;
typedef struct
{ ElemType *R;
int length; } SSTable;
void Create(SSTable &T)
{ int i;
T.R=new ElemType[MAXSIZE+1];
cin>>T.length;
for(i=1;i<=T.length;i++)
cin>>T.R[i].key; }
int Search_Bin(SSTable T, KeyType k);
int main ()
{ SSTable T;
KeyType k;
Create(T);
cin>>k;
int pos=Search_Bin(T,k);
if(pos==0)
cout<<"NOT FOUND"<<endl;
else cout<<pos<<endl; return 0; }
/* 请在这里填写答案 */
int Search_Bin(SSTable T, KeyType k)
{
int i=1,j=T.length;
int mid;
while(i<j)
{ mid=(i+j)/2;
if(T.R[mid].key==k)
return mid;
if(T.R[mid].key>k)
j=mid-1;
if(T.R[mid].key<k)
i=mid+1;
}
return 0;
}