顺序查找又称之为线性查找,是一种最简单的查找法啊
//顺序查找法
#include <iostream>
#include <cstdlib>
#include <time.h>
using namespace std;
void main()
{
//建立数据
int nData[900]; //新建一个大小为500的数组,存放0-500的数据
int i;
srand((unsigned)time(NULL));
for(i = 0; i < 900; i++)
{
nData[i] = rand()%100;
cout << i+1 << "[" << nData[i] <<"]" << "\t";
}
cout << endl;
//查找
cout << "请输入要查找的数字(0 - 100):";
int nFind;
cin >> nFind;
int n = 0;
for(i = 0; i < 900; i++)
{
if(nFind == nData[i])
{
cout << "第" << i+1 << "个数是" << nFind << endl;
n++;
}
else{}
}
if(n==0)
cout << "没有找到!!!\n";
else
cout << "找到" << n << "个\n";
}