打卡3.16

pta二分法的运用折半查找。一开始被typedef晃了眼，找不到数组的位置，结果卡在了数组。以后还是得好好看题给的代码。

#include
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(pos0) cout<<“NOT FOUND”<<endl;
else cout<<pos<<endl;
return 0;
}
int Search_Bin(SSTable T, KeyType k){
int mid=0,begin,end;
begin=0;
end=T.length-1;
mid=(begin+end)/2;
while(begin<=end){
if(T.R[mid].keyk)
break;
if(T.R[mid].key<k){
begin=mid+1;
mid=(begin+end)/2;}
else
{end=mid-1;
mid=(begin+end)/2;
}
}
if(begin<=end)
return mid;
else
return 0;
}