-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathminmax1.cpp
68 lines (57 loc) · 1.23 KB
/
minmax1.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#include<iostream>
using namespace std;
// Pair struct is used to return
// two values from getMinMax()
struct Pair
{
int max;
int min;
};
Pair getMinMax(int arr[], int n)
{
struct Pair minmax;
int i;
//the array has only one element
if(n == 1)
{
minmax.max = arr[0];
minmax.min = arr[0];
return minmax;
}
// the array has more than one element
if (arr[0] > arr[1])
{
minmax.max = arr[0];
minmax.min = arr[1];
}
else
{
minmax.max = arr[1];
minmax.min = arr[0];
}
for (i = 2; i < n; i++)
{
if (arr[i] > minmax.max)
{
minmax.max = arr[i];
}
else if (arr[i] < minmax.min)
{
minmax.min = arr[i];
}
}
return minmax;
}
// Driver code
int main()
{
int arr[] = { 1000, 11, 445,
1, 330, 3000 };
int arr_size = sizeof(arr) / sizeof(arr[0]);
struct Pair minmax = getMinMax(arr, arr_size);
cout << "Minimum element is "
<< minmax.min << endl;
cout << "Maximum element is "
<< minmax.max;
return 0;
}