#include <stdio.h>
#include <stdlib.h>
struct node
{
int *h, len, size;
}list;
void creat(int n)
{
list.h = (int *)malloc((n + 5) * sizeof(int));
}
void get(int n)
{
for(int i = 1; i <= n; i++)
{
scanf("%d", &list.h[i]);
}
}
int fin(int l, int r, int x)
{
if(l == r)
{
if(x == list.h[l])return l;
else return -1;
}
int mid = (l + r) / 2;
if(list.h[mid] < x)return fin(mid + 1, r, x);
else return fin(l, mid, x);
}
int main()
{
int n, m, i, x;
scanf("%d", &n);
creat(n);
get(n);
scanf("%d", &m);
for(i = 1; i <= m; i++)
{
scanf("%d", &x);
int ans = fin(1, n, x);
if(ans == -1)printf("No Found!\n");
else printf("%d\n", ans);
}
return 0;
}
SDUT - 3330 顺序表应用6:有序顺序表查询
猜你喜欢
转载自blog.csdn.net/Miracle_QSH/article/details/82419215
今日推荐
周排行