【数据结构7】查找

1、线性结构的查找

1-1 顺序查找

#include <stdio.h>
#include <stdlib.h>

#define NUMBER (10 + 1)
#define MIN ((1<<31))

typedef struct {
        int *data;
        int length;
}SSTable;

int search_seq1(SSTable* ST, int key){
        int i;
        ST->data[0] = key;       // 哨兵
        for(i = ST->length; ST->data[i] != key; i--);
        return i;               // 当查找不到返回0
}

int main()
{
        int d;
        SSTable T;
        T.length = NUMBER;
        T.data = (int *)malloc(sizeof(int) * NUMBER);
        T.data[0] = MIN, T.data[1] = 3, T.data[3] = 4;//...

        while(~scanf("%d", &d)){
                printf("the %d at No.%d\n", d, search_seq1(&T, d));
        }

        return 0;
}

1-2 折半查找

#include <stdio.h>

#define NUMBER (10)

typedef struct {
        int