PROGRAM(C):- To find the greatest and least elements from an array.

HAY THANK FOR VISIT

Given an array A of size N of integers. Your task is to find the minimum and maximum elements in the array.

 

Example 1:

Input:
N = 6
A[] = {3, 2, 1, 56, 10000, 167}
Output: 1 10000
Explanation: minimum and maximum elements of array are 1 and 10000.

 

Example 2:

Input:
N = 5
A[]  = {1, 345, 234, 21, 56789}
Output: 1 56789
Explanation: minimum and maximum element of array are 1 and 56789.

 

Your Task:  
You don't need to read input or print anything. Your task is to complete the function getMinMax() which takes the array A[] and its size N as inputs and returns the minimum and maximum element of the array.

 

Expected Time Complexity: O(N)
Expected Auxiliary Space: O(1)

 

Constraints:
1 <= N <= 105
1 <= Ai <=1012

SOLUTION:-

#include <stdio.h>

struct pair {

    long long int min;

    long long int max;

};

struct pair getMinMax(long long int arr[], long long int n) ;

int main() {

    long long int t, n, a[100002], i;

    struct pair minmax;

    scanf("%lld", &t);

    while (t--) {

        scanf("%lld", &n);

        for (i = 0; i < n; i++) scanf("%lld", &a[i]);

        minmax = getMinMax(a, n);

        printf("%lld %lld\n", minmax.min, minmax.max);

    }

    return 0;

}

// } Driver Code Ends

// User function Template for C

struct pair getMinMax(long long int arr[], long long int n) {

    struct pair minMax;

    int s=arr[0];

    int g=arr[0];

    for(int i=1;i<n;i++)

    {

        if(g<arr[i])

          g=arr[i];

        if(s>arr[i])

          s=arr[i];

    }

    minMax.min=s;

    minMax.max=g;

    return minMax;

    

}