Java/Solution.java at main · HarshYadav1159/Java · 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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
import java.io.*;
import java.util.Scanner;
import java.math.*;

public class Solution{
   static int minimum = 0;
   static int maximum = 0;

     public static void findMin(int a[], int left , int right){
       //one element
        if(left - right==0)
        {
            if(minimum > a[left])
            {
                minimum = a[left];

            }
            if(maximum < a[left])
            {
                maximum= a[left];

            }
            return;
        }

        //two element
        if(right - left == 1)
        {
           if(a[left] < minimum)
           {
               minimum = a[left];
           }
           if(a[left] > maximum)
           {
               maximum = a[left];
           }
           if(a[right] < minimum)
           {
            minimum = a[right];
           }
           if(a[right] > maximum)
           {
            maximum = a[right];
           }
           return;
        }

       int mid = (left+right)/2;

       findMin(a,0,left);
       findMin(a,mid,right);

       return;
    }


    public static void main(String args[]){

     Scanner sc = new Scanner(System.in);
        int n;
        n = sc.nextInt();
        int[] a = new int[n];

       for(int i =0;i<n;i++){
           a[i]=sc.nextInt();
       }
       minimum = a[0];
      findMin(a,0,n-1);
   System.out.println("Minimum is "+minimum);
   System.out.print("Maximum is "+maximum);
    }
}