排序算法三：顺序查找

#include <iostream>

using namespace std;

int SequentialSearch(int *,const int,const int);

int main()
{
    int array[]{2,4,6,8,0,1,3,5,7,9};
    int resultIndex = SequentialSearch(array,10,17);
    if(resultIndex == -1){
        cout<<"查找失败！"<<endl;
    }
    else{
        cout<<"第"<<resultIndex+1<<"个元素"<<endl;;
    }
    return 0;
}

//a为数组，*a为数组第一个元素地址,n为数组长度，x为查找的元素
int SequentialSearch(int *a,const int n, const int x){
    int i;
    for(i=0;i<n;i++){
        if(a[i]==x){
            return i;
        }
    }
    return -1;
}

查找失败！