3376=数据结构实验之查找四：二分查找

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int queue[100000];
int find(int left,int right,int temp)
{
    if(right<left)return -1;
    int mid=(left+right)/2;
    if(temp==queue[mid])return mid;
    else if(temp<queue[mid]) return find(left,mid-1,temp);
    else if(temp>queue[mid]) return find(mid+1,right,temp);
}
int main()
{
    int n,m,i,t;
    scanf("%d %d",&n,&m);
    for(i=0;i<n;i++)
    {
        scanf("%d",&queue[i]);
    }
    /*题目的要求是序号从0开始，因此下标从0开始*/
    for(i=1;i<=m;i++)
    {
        scanf("%d",&t);
        printf("%d
",find(0,n-1,t));
    }
    return 0;
}