-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMaxMin.cpp
64 lines (63 loc) · 1.31 KB
/
MaxMin.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
#include<iostream>
using namespace std;
class Suvrodev
{
public:
int Mid;
void MaxMin(int*,int,int,int&,int&);
};
void Suvrodev::MaxMin(int* Data,int begin,int end,int& max,int& min)
{
if(begin==end)
{
max=min=Data[begin];
}
else if(begin==end-1)
{
if(Data[begin]>Data[end])
{
max=Data[begin];
min=Data[end];
}
else
{
max=Data[end];
min=Data[begin];
}
}
else
{
Mid=(begin+end)/2;
MaxMin(Data,begin,Mid,max,min);
int HelperMax;
int HelperMin;
MaxMin(Data,Mid+1,end,HelperMax, HelperMin);
if(HelperMax>max)
{
max=HelperMax;
}
if(HelperMin<min)
{
min=HelperMin;
}
}
}
int main()
{
cout<<"MaxMin Algorithm"<<endl;
Suvrodev v;
int Limit,begin=1,max,min;
cout<<"Enter the Limit of Array:";
cin>>Limit;
int Data[Limit];
cout<<"Enter Element from here"<<endl;
for(int i=begin;i<=Limit;i++)
{
cout<<i<<". Enter Input:";
cin>>Data[i];
}
v.MaxMin(Data,begin,Limit,max,min);
cout<<"Maximum Value:"<<max<<endl;
cout<<"Minimum Value:"<<min<<endl;
return 0;
}