CSE2202-Algorithm-Design-and-Analysis/MaxMin.cpp at main · alamgir-ahosain/CSE2202-Algorithm-Design-and-Analysis · GitHub

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
#include<bits/stdc++.h>
using namespace std;
int Maxi=-1,Mini=100000;
void MaxMin(int a[],int i,int j)
{
    int max1,min1,mid;
    if(i==j) Maxi=Mini=a[i];
    else
    {
        if(i==j-1)
        {
            if(a[i]<a[j])
            {
                Maxi=a[j];
                Mini=a[i];
            }
            else
            {
                Maxi=a[i];
                Mini=a[j];
            }
        }
        else
        {
            mid=(i+j)/2;

            //min max for left subpPartt
            MaxMin(a,i,mid);
            max1=Maxi,min1=Mini;

            MaxMin(a,mid+1,j);

            //min max for left+right part
            if(Maxi<max1) Maxi=max1;
            if(Mini>min1) Mini=min1;

        }
    }


}
int main()
{
    int n;
    cin>>n;
    int a[n];
    for(int i=0;i<n;i++) cin>>a[i];
    MaxMin(a,0,n-1);
    cout<<Maxi<<" "<<Mini<<endl;


}