SDUT 3330 二分查找

顺序表的应用 题目链接

#include <cstdio>
#include <cstdlib>

const int Maxsize = 1e6+5;
typedef int ElemType;

typedef struct
{
    ElemType *ele;
    int length;
    int maxsize;
} List;

int Binary_Search(List &L, int k)
{
    int i = 0, j = L.length-1;
    while(i <= j)
    {
        int mid = (i + j)>>1;
        if(L.ele[mid] == k) return mid+1;
        if(L.ele[mid] < k) i = mid+1;
        else j = mid-1;
    }
    return 0;
}

void Create(List &L)
{
    L.ele = (ElemType *)malloc(Maxsize * sizeof(ElemType));
    if(!L.ele) exit(-2);
    L.length = 0;
    L.maxsize = Maxsize;
    int m;
    scanf("%d", &m);
    for(int i = 0; i < m; i++)
    {
        scanf("%d", &L.ele[L.length++]);
    }
}



int main()
{
    List L;
    Create(L);
    int n;
    scanf("%d", &n);
    for(int i = 0; i < n; i++)
    {
        int t;
        scanf("%d", &t);
        int re = Binary_Search(L, t);
        if(re == 0) printf("No Found!\n");
        else printf("%d\n", re);
    }
    return 0;
}