#include<stdio.h>
#include<iostream>
#include<algorithm>
#define maxn 100
using namespace std;
typedef struct
{
int num[maxn];
int length;
}SSTable;
int search(SSTable ST,int key,int low,int high)
{
int mid;
//low=1;high=ST.length;
if(low<=high)
{
mid=(low+high)/2;
if(key==ST.num[mid]) return mid;
else if(key<ST.num[mid]) search(ST,key,low,mid-1);
else if(key>ST.num[mid]) search(ST,key,mid+1,high);
}
<span style="white-space:pre"> </span>else
return 0;
}
int main()
{
int i,n,position;
int key;
SSTable ST;
int low,high,mid;
printf("输入元素的个数:");
scanf("%d",&n);
ST.length=n;//将n赋值给表长