【C++数据结构】算法：顺序查找（SequentialSearch）

没有排序的的数据：只能顺序查找，一个一个进行匹配

速度十分慢

代码

#include <iostream>
using namespace std;

int SequentialSearch(int *list, int n, int x);

int main(){
    int a[] = {3,2,5,12,32,14};
    int len = sizeof(a)/ sizeof(a[0]);
    int x = 12;

    int index = SequentialSearch(a, len, x);
    if (index==-1)
        cout << "未找到该数据" << endl;
    else
        cout << x << "的索引为"  << index << endl;

    return 0;
}

int SequentialSearch(int *list, int n, int x){
    for (int i = 0; i < n; i++) {
        if (list[i] == x)
            return i;
    }
    return -1;
}

// 输出
// 12的索引为3