顺序查找是指从数组的一段逐个进行比较,直到找到该数据为止。
#include <stdio.h> /** * 顺寻查找 * @return */ int main() { int a[] = {1, 5, 66, 8, 55, 9, 99, 32, 5, 65, 4, 8, 5, 15, 64, 156, 1564, 15, 1, 8, 9, 7, 215, 16, 45, 5, 6, 164, 15, 236, 2, 5, 6, 4, 1, 59, 23, 4, 1, 59, 23, 4, 5, 314, 56, 15, 3,54, 1, 54, 2, 4, 4, 5, 15, 798, 489, 56, 56, 26, 98, 78, 456, 1894, 564, 26, 56, 51}; int n; //存放数组a中的个数 int m; //查找的数字 int i; //循环变量 n = sizeof(a) / sizeof(int); //求出数组中所有的元素个数 printf("请输入一个数字:"); scanf("%d", &m); for (i = 0; i < n; ++i) { if (a[i] == m) { printf("下标 = %d\n", i); } } if (i == n) { printf("sorry\n"); } return 0; }