#include<stdio.h>
#include<stdlib.h>
typedef struct{
	int key;
}Elemtype;
typedef struct{
	Elemtype *elem;
	int length;
}Table;
int Create(Table &S,int n){
	S.elem=(Elemtype *)malloc(n*sizeof(Elemtype));
	if(!S.elem){
		S.length=0;
		exit(0);	
	}
	else
		S.length=n;
		return 1;
}
int Search(Table S,int key,int low,int high){
	int mid;
	while(low<=high){
		mid=(low+high)/2;
		if(key=S.elem[mid].key){
			return mid;
		}
		else if(key<S.elem[mid].key){
			return Search(S,key,low,mid-1);
		}
		else 
			return Search(S,key,mid+1,high);
	}
	return 0;//查找失败 
}
int main(){
	int key,i,n;
	Table S;
	printf("输入表长：");
	scanf("%d",&n);
	Create(S,n);
	printf("输入有序表：");
	for(i=0;i<S.length;i++){
		scanf("%d",&S.elem[i].key);
	}
	printf("输入要查找的数：");
	scanf("%d",&key);
	printf("元素所在位置：%d",Search(S,key,0,n-1)+1);
	return 0;
}