简单算法（3）顺序查找

#include<iostream>
using namespace std;

int  search(int a[],int  key,int n)
{
	for (int i = 0; i < n; ++i)
		if (key == a[i])
			return i;
}

int main()
{
	int a[] = { 4,8,2,5,9,1,3,0,15 };
	int n = sizeof(a) / sizeof(a[0]);
	int test;
	cout << n << endl;
	cout << "请输入所要查找的值：";
	cin >> test;
	cout << "你所查找的值的位置是:"<< search(a,test,n);
	cout << endl;
	system("pause");
	return 0;
}

内容不是很严谨，请谅解。