C ++程序使用线性搜索在数组中查找最小元素
这是一个使用线性搜索方法查找数组的最小元素的C++程序。该程序的时间复杂度为O(n)。
算法
Begin Assign the data element to an array. Assign the value at ‘0’ index to minimum variable. Compare minimum with other data element sequentially. Swap values if minimum value is more then the value at that particular index of the array. print the minimum value. End
范例程式码
#include<iostream>
using namespace std;
int main() {
int n, i, minimum, a[10] = {1, 6, 7, 10, 12, 14, 12, 16, 20, 26};
char ch;
minimum = a[0];
cout<<"\nThe data element of array:";
for(i = 0; i < 10; i++) {
cout<<" "<<a[i];
if(minimum > a[i])
minimum= a[i];
}
cout<<"\n\nMinimum of the data elements of array using linear search is: "<<minimum;
return 0;
}输出结果
The data element of array: 1 6 7 10 12 14 12 16 20 26 Minimum of the data elements of array using linear search is: 1
热门推荐
2 图书馆简短祝福语
10 兔年简短祝福语8字
11 过生日祝福语简短爸爸
12 生日祝福语简短霸气男
13 五一快乐祝福语简短老师
14 新婚宴祝福语简短大全
15 关于糖果的祝福语简短
16 幼儿祝福语大全简短贺卡
17 圣诞祝福语简短给师姐
18 蛋糕祝福语简短闺蜜