数据结构(15) - 顺序查找

顺序查找是按照序列原有顺序对数组进行遍历比较查询的基本查找算法。对于任意一个序列以及一个给定的元素，将给定元素与序列中元素依次比较，直到找出与给定关键字相同的元素，或者将序列中的元素与其都比较完为止。

/**
 * C data structure sequence search example.
 * 
 * License - MIT.
*/

#include <stdio.h>


#define DISPLAY_ARRAY(i, buf, len) \
        do { \
            for (i = 0; i < len; i++) \
                printf("%d ", buf[i]); \
            printf("\n"); \
        } while(0)


/**
 * sequence_search - Sequence search.
*/
int sequence_search(int *buf, int len, int key)
{
    for (int i = 0; i < len; i++) {
        if (key == buf[i])
            return i;
    }

    return -1;
}


/**
 * Main function.
*/
int main(void)
{
    int i = 0;
    int ret = -1;
    int key = 10;
    int buf[] = {83, 21, 28, 47, 69, 10, 43, 33, 5, 41};
    int len = sizeof(buf) / sizeof(int);

    printf("The original array:\n");
    DISPLAY_ARRAY(i, buf, len);

    ret = sequence_search(buf, len, key);

    if (0 > ret) {
        printf("Not found key: %d.\n", key);
    }
    else {
        printf("Find key %d at index: %d.\n", key, ret);
    }

    return 0;
}

 

详情可参考Github: [Link] [https://github.com/Phoebus-Ma/C-Helper/tree/main/Class-1/Search.C].