-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathmain.cpp
More file actions
85 lines (64 loc) · 1.61 KB
/
Copy pathmain.cpp
File metadata and controls
85 lines (64 loc) · 1.61 KB
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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include <iostream>
using namespace std;
void minmax(int inputArr[], int low, int high, int &min, int &max);
int main()
{
int size;
cout << "Enter total number of elements: ";
cin >> size;
int inputArr[size];
cout << "Enter elements of array\n";
for (int i = 0; i < size; i++)
{
cin >> inputArr[i];
}
int max = INT_MIN, min = INT_MAX;
minmax(inputArr, 0, size - 1, min, max);
cout << "\nValue of Minimum element is: " << min << endl;
cout << "Value of Maximum element is: " << max << endl;
return 0;
}
void minmax(int inputArr[], int low, int high, int &min, int &max)
{
if (low == high)
{
if (max < inputArr[low])
{
max = inputArr[low];
}
if (min > inputArr[high])
{
min = inputArr[high];
}
return;
}
if (high - low == 1)
{
if (inputArr[low] < inputArr[high])
{
if (min > inputArr[low])
{
min = inputArr[low];
}
if (max < inputArr[high])
{
max = inputArr[high];
}
}
else
{
if (min > inputArr[high])
{
min = inputArr[high];
}
if (max < inputArr[low])
{
max = inputArr[low];
}
}
return;
}
int mid = (low + high) / 2;
minmax(inputArr, low, mid, min, max);
minmax(inputArr, mid + 1, high, min, max);
}