[R语言] 顺序表应用6：有序顺序表查询

#include <iostream>
using namespace std;
typedef struct
{
  int *elem;
  int length;
  int Listsize;
}List;
void CreateList(List &L,int n)
{
  L.elem=new int [100001];
  L.length=n;
  for(int i=0;i<=n-1;i++)
  {
    cin>>L.elem[i];
  }
}
int find(List &L,int high,int low,int key)
{
  while(low<=high)
  {
    int mid=(high+low)/2;
    if(L.elem[mid]==key)return mid+1;
    else if(L.elem[mid]>key)high=mid-1;
    else if(L.elem[mid]<key)low=mid+1;
  }
  return -1;
}
int main()
{
  List L;
  int n;
  cin>>n;
  CreateList(L,n);
  int t;
  cin>>t;
  while(t--)
  {
    int x;
    cin>>x;
    int y;
    y=find(L,n-1,0,x);
    if(y==-1)cout<<"No Found!"<<endl;
    else   cout<<y<<endl;
  }
  return 0;
}