顺序查找c++

#include<iostream>
using namespace std;

int sqeSearch(int *list, const int x, const int n);

int main()
{
	int a[] = {1,2,3,4,5,6,9,8,7};
	int n = sizeof(a) / sizeof(a[0]);
	int x = 5;
	int m =sqeSearch(a, x, n);
	if (m == -1) cout << "没找到" << endl;
	else cout << "a[" << m << "] = " << x <<  endl;
	cin.get();
	return 0;
}
int sqeSearch(int *list, const int x, const int n)
{
	int i;
	for (i = 0; i < n; i++)
	{
		if (list[i] == x) return i;
	}
	if (i == n) return -1;
}

const关键字数可以保证变量不被改变。