#include <iostream>
using namespace std;
// 顺序查找
int sequenceSearch(int* arr, int len, int num);
int main(void)
{
int arr[] = { 45, 9, 19, 103, 47, 89, 12, 406, 38, 5, 95, 478, 693, 865, 53 };
int len = sizeof(arr) / sizeof(arr[0]);
int num;
cout << "请输入你要查找的数字:" << endl;
cin >> num;
int pos = sequenceSearch(arr, len, num);
if (pos == -1)
cout << "你要查找的数字未在数组中." << endl;
else
cout << "你要查找的数字在第" << pos + 1 << "个位置" << endl;
system("pause");
return 0;
}
int sequenceSearch(int* arr, int len, int num)
{
int pos = -1;
for (size_t i = 0; i < len; i++)
{
if (arr[i] == num)
{
pos = i;
break;
}
}
return pos;
}
顺序查找算法
最新推荐文章于 2024-04-23 22:44:16 发布