The Wayback Machine - https://web.archive.org/web/20211125222658/https://www.geeksforgeeks.org/program-find-minimum-maximum-element-array/
Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Program to find the minimum (or maximum) element of an array

  • Difficulty Level : Easy
  • Last Updated : 07 May, 2021

Given an array, write functions to find the minimum and maximum elements in it. 

Attention reader! All those who say programming isn't for kids, just haven't met the right mentors yet. Join the  Demo Class for First Step to Coding Course, specifically designed for students of class 8 to 12. 

The students will get to learn more about the world of programming in these free classes which will definitely help them in making a wise career choice in the future.

C++




// CPP program to find minimum (or maximum) element
// in an array.
#include <bits/stdc++.h>
using namespace std;
 
int getMin(int arr[], int n)
{
    int res = arr[0];
    for (int i = 1; i < n; i++)
        res = min(res, arr[i]);
    return res;
}
 
int getMax(int arr[], int n)
{
    int res = arr[0];
    for (int i = 1; i < n; i++)
        res = max(res, arr[i]);
    return res;
}
 
int main()
{
    int arr[] = { 12, 1234, 45, 67, 1 };
    int n = sizeof(arr) / sizeof(arr[0]);
    cout << "Minimum element of array: " << getMin(arr, n) << "\n";
    cout << "Maximum element of array: " << getMax(arr, n);
    return 0;
}
Java



// Java program to find minimum (or maximum)
// element in an array.
import java.io.*;
 
class GFG {
     
    static int getMin(int arr[], int n)
    {
        int res = arr[0];
         
        for (int i = 1; i < n; i++)
            res = Math.min(res, arr[i]);
        return res;
    }
     
    static int getMax(int arr[], int n)
    {
        int res = arr[0];
         
        for (int i = 1; i < n; i++)
            res = Math.max(res, arr[i]);
        return res;
    }
 
    // Driver code
    public static void main (String[] args)
    {
        int arr[] = { 12, 1234, 45, 67, 1 };
        int n = arr.length;
        System.out.println( "Minimum element"
           + " of array: " + getMin(arr, n));
        System.out.println( "Maximum element"
           + " of array: " + getMax(arr, n));
    }
}
 
// This code is contributed by anuj_67.
Python3



# Python3 program to find minimum
# (or maximum) element in an array
 
# Minimum Function
def getMin(arr, n):
    res = arr[0]
    for i in range(1,n):
        res = min(res, arr[i])
    return res
 
# Maximum Function
def getMax(arr, n):
    res = arr[0]
    for i in range(1,n):
        res = max(res, arr[i])
    return res
 
# Driver Program
arr = [12, 1234, 45, 67, 1]
n = len(arr)
print ("Minimum element of array:", getMin(arr, n))
print ("Maximum element of array:", getMax(arr, n))
 
# This code is contributed
# by Shreyanshi Arun.
C#



// C# program to find
// minimum (or maximum)
// element in an array.
using System;
 
class GFG
{
    static int getMin(int []arr,
                      int n)
    {
        int res = arr[0];
         
        for (int i = 1; i < n; i++)
            res = Math.Min(res, arr[i]);
        return res;
    }
     
    static int getMax(int []arr,
                      int n)
    {
        int res = arr[0];
         
        for (int i = 1; i < n; i++)
            res = Math.Max(res, arr[i]);
        return res;
    }
 
    // Driver code
    public static void Main ()
    {
        int []arr = {12, 1234, 45, 67, 1};
        int n = arr.Length;
        Console.Write("Minimum element" +
                          " of array: " +
                         getMin(arr, n) + "\n" );
        Console.Write("Maximum element" +
                          " of array: " +
                         getMax(arr, n));
    }
}
 
// This code is contributed by Smita.
PHP



<?php
// PHP program to find minimum
// (or maximum) element in an
// array.
 
function getMin($arr, $n)
{
    $res = $arr[0];
    for ($i = 1; $i < $n; $i++)
        $res = min($res, $arr[$i]);
    return $res;
}
 
function getMax($arr, $n)
{
    $res = $arr[0];
    for ($i = 1; $i < $n; $i++)
        $res = max($res, $arr[$i]);
    return $res;
}
 
    // Driver Code
    $arr = array(12, 1234, 45, 67, 1);
    $n = sizeof($arr);
    echo "Minimum element of array: "
           , getMin($arr, $n), "\n";
    echo "Maximum element of array: "
                  ,getMax($arr, $n);
 
// This code is contributed by ajit
?>
Javascript



<script>
 
// JavaScript program to find minimum
// (or maximum) element in an array.
function getMin(arr, n)
{
    let res = arr[0];
      
    for(let i = 1; i < n; i++)
        res = Math.min(res, arr[i]);
         
    return res;
}
  
function getMax(arr, n)
{
    let res = arr[0];
      
    for(let i = 1; i < n; i++)
        res = Math.max(res, arr[i]);
         
    return res;
}
 
// Driver Code
let arr = [ 12, 1234, 45, 67, 1 ];
let n = arr.length;
 
document.write("Minimum element" +
               " of array: " +
               getMin(arr, n) + "<br/>");
document.write("Maximum element" +
               " of array: " +
               getMax(arr, n));
                
// This code is contributed by sanjoy_62
 
</script>
Output: 
Minimum element of array: 1
Maximum element of array: 1234
Time Complexity:O(n)


Recursive Solution 
C++



// CPP program to find
// minimum (or maximum) element
// in an array.
#include <bits/stdc++.h>
using namespace std;
 
int getMin(int arr[], int n)
{
    // If there is single element, return it.
    // Else return minimum of first element and
    // minimum of remaining array.
    return (n == 1) ? arr[0] : min(arr[0],
                         getMin(arr + 1, n - 1));
}
 
int getMax(int arr[], int n)
{
    // If there is single element, return it.
    // Else return maximum of first element and
    // maximum of remaining array.
    return (n == 1) ? arr[0] : max(arr[0],
                          getMax(arr + 1, n - 1));
}
 
int main()
{
    int arr[] = { 12, 1234, 45, 67, 1 };
    int n = sizeof(arr) / sizeof(arr[0]);
    cout << "Minimum element of array: " <<
                            getMin(arr, n) << "\n";
    cout << "Maximum element of array: " <<
                                   getMax(arr, n);
    return 0;
}
Java



// Java program to find minimum
// (or maximum) element
// in an array.
class GFG
{
 
static int getMin(int arr[], int i, int n)
{
    // If there is single element, return it.
    // Else return minimum of first element and
    // minimum of remaining array.
    return (n == 1) ? arr[i] : Math.min(arr[i],
                        getMin(arr,i + 1 , n - 1));
}
 
static int getMax(int arr[], int i, int n)
{
    // If there is single element, return it.
    // Else return maximum of first element and
    // maximum of remaining array.
    return (n == 1) ? arr[i] : Math.max(arr[i],
                         getMax(arr ,i + 1, n - 1));
}
 
// Driver code
public static void main(String[] args)
{
    int arr[] = { 12, 1234, 45, 67, 1 };
    int n = arr.length;
    System.out.print("Minimum element of array: " +
                        getMin(arr, 0, n) + "\n");
    System.out.println("Maximum element of array: " +
                        getMax(arr, 0, n));
    }
}
 
/* This code contributed by PrinciRaj1992 */
Python3



# Python3 program to find minimum
# (or maximum) element in an array.
def getMin(arr, n):
    if(n==1):
        return arr[0]
    # If there is single element, return it.
    # Else return minimum of first element
    # and minimum of remaining array.
    else:
        return min(getMin(arr[1:], n-1), arr[0])
def getMax(arr, n):
    if(n==1):
        return arr[0]
    # If there is single element, return it.
    # Else return maximum of first element
    # and maximum of remaining array.
    else:
        return max(getMax(arr[1:], n-1), arr[0])
 
# Driver code
arr = [12, 1234, 45, 67, 1]
n = len(arr)
print("Minimum element of array: ",
                   getMin(arr, n));
print("Maximum element of array: ",
                   getMax(arr, n));
 
# This code is contributed by
# Mohit Kumar 29
C#



// C# program to find minimum
// (or maximum) element
// in an array.
using System;
 
class GFG
{
 
static int getMin(int []arr, int i, int n)
{
    // If there is single element, return it.
    // Else return minimum of first element and
    // minimum of remaining array.
    return (n == 1) ? arr[i] : Math.Min(arr[i],
                    getMin(arr,i + 1 , n - 1));
}
 
static int getMax(int []arr, int i, int n)
{
    // If there is single element, return it.
    // Else return maximum of first element and
    // maximum of remaining array.
    return (n == 1) ? arr[i] : Math.Max(arr[i],
                    getMax(arr ,i + 1, n - 1));
}
 
// Driver code
public static void Main(String[] args)
{
    int []arr = { 12, 1234, 45, 67, 1 };
    int n = arr.Length;
    Console.WriteLine("Minimum element of array: " +
                                getMin(arr, 0, n));
    Console.WriteLine("Maximum element of array: " +
                                getMax(arr, 0, n));
}
}
 
// This code is contribute by Mohit
Javascript



<script>
// javascript program to find minimum
// (or maximum) element
// in an array.   
function getMin(arr , i , n) {
        // If there is single element, return it.
        // Else return minimum of first element and
        // minimum of remaining array.
        return (n == 1) ? arr[i] : Math.min(arr[i], getMin(arr, i + 1, n - 1));
    }
 
    function getMax(arr , i , n) {
        // If there is single element, return it.
        // Else return maximum of first element and
        // maximum of remaining array.
        return (n == 1) ? arr[i] : Math.max(arr[i], getMax(arr, i + 1, n - 1));
    }
 
    // Driver code
     
        var arr = [ 12, 1234, 45, 67, 1 ];
        var n = arr.length;
        document.write("Minimum element of array: " + getMin(arr, 0, n) + "<br/>");
        document.write("Maximum element of array: " + getMax(arr, 0, n));
 
// This code contributed by Rajput-Ji
</script>
Output: 
Min of array: 1
Max of array: 1234
Using Library functions: 
We can use min_element() and max_element() to find minimum and maximum of array. 
C++



// CPP program to find minimum (or maximum) element
// in an array.
#include <bits/stdc++.h>
using namespace std;
 
int getMin(int arr[], int n)
{
    return *min_element(arr, arr + n);
}
 
int getMax(int arr[], int n)
{
    return *max_element(arr, arr + n);
}
 
int main()
{
    int arr[] = { 12, 1234, 45, 67, 1 };
    int n = sizeof(arr) / sizeof(arr[0]);
    cout << "Minimum element of array: " << getMin(arr, n) << "\n";
    cout << "Maximum element of array: " << getMax(arr, n);
    return 0;
}
Java



import java.util.Arrays;
 
// Java program to find minimum (or maximum) element
// in an array.
import java.util.Arrays;
 
class GFG {
 
    static int getMin(int arr[], int n) {
        return Arrays.stream(arr).min().getAsInt();
    }
 
    static int getMax(int arr[], int n) {
        return Arrays.stream(arr).max().getAsInt();
    }
 
// Driver code
    public static void main(String[] args) {
        int arr[] = {12, 1234, 45, 67, 1};
        int n = arr.length;
        System.out.println("Minimum element of array: " + getMin(arr, n));
        System.out.println("Maximum element of array: " + getMax(arr, n));
    }
}
/*This Java code is contributed by 29AjayKumar*/
Python3



# Python3 program to find minimum
# (or maximum) element
# in an array.
def getMin(arr,n):
    return min(arr)
 
def getMax(arr,n):
    return max(arr)
 
# Driver Code
if __name__=='__main__':
    arr = [12,1234,45,67,1]
    n = len(arr)
    print("Minimum element of array: "
          ,getMin(arr, n))
    print("Maximum element of array: "
          ,getMax(arr, n))
 
# This code is contributed by
# Shrikant13
C#



// C# program to find minimum
// (or maximum) element in an array.
using System;
using System.Linq;
class GFG
{
static int getMin(int []arr, int n)
{
    return arr.Min();
}
 
static int getMax(int []arr, int n)
{
    return arr.Max();
}
 
// Driver code
public static void Main(String[] args)
{
    int []arr = {12, 1234, 45, 67, 1};
    int n = arr.Length;
    Console.WriteLine("Minimum element of array: " +
                                    getMin(arr, n));
    Console.WriteLine("Maximum element of array: " +
                                    getMax(arr, n));
}
}
 
// This code is contributed by 29AjayKumar
PHP



<?php
// PHP program to find minimum (or maximum)
// element in an array.
 
function getMin(&$arr, $n)
{
    return min($arr);
}
 
function getMax(&$arr, $n)
{
    return max($arr);
}
 
// Driver Code
$arr = array(12, 1234, 45, 67, 1 );
$n = sizeof($arr);
echo "Minimum element of array: " .
           getMin($arr, $n) . "\n";
echo "Maximum element of array: " .
                  getMax($arr, $n);
 
// This code is contributed
// by ChitraNayal
?>
Javascript



<script>
 
// Javascript program to find
// minimum (or maximum) element
// in an array.
 
    function getMin(arr , n)
    {
        return Math.min.apply(Math,arr);
    }
 
    function getMax(arr , n) {
        return Math.max.apply(Math,arr);
    }
 
    // Driver code
     
        var arr = [ 12, 1234, 45, 67, 1 ];
        var n = arr.length;
        document.write("Minimum element of array: " +
        getMin(arr, n)+"<br/>");
        document.write("Maximum element of array: "
        + getMax(arr, n));
 
// This code contributed by aashish1995
 
</script>
Output:
Minimum element of array: 1
Maximum element of array: 1234



My Personal Notes
arrow_drop_up
Next

Maximum and minimum of an array using minimum number of comparisons
Recommended Articles
Page :
Minimum distance between the maximum and minimum element of a given Array
16, Jul 20
Maximum sum in an array such that every element has exactly one adjacent element to it
23, May 19
Check if minimum element in array is less than or equals half of every other element
02, May 20
Count subarrays which contains both the maximum and minimum array element
10, Sep 20
Count subsequences which contains both the maximum and minimum array element
10, Sep 20
Sum and Product of minimum and maximum element of an Array
30, Oct 18
Leftmost and rightmost indices of the maximum and the minimum element of an array
19, Dec 18
Split array into minimum number of subsets with every element of a subset divisible by its minimum
12, Feb 21
Program to find the maximum element in a Matrix
26, Oct 18
Maximum and minimum of an array using minimum number of comparisons
15, Feb 10
Find the maximum element in an array which is first increasing and then decreasing
14, Jan 12
Find maximum sum taking every Kth element in the array
05, Apr 19
Find the array element having maximum frequency of the digit K
05, Jan 21
Queries to find the maximum array element after removing elements from a given range
01, Feb 21
Find the minimum element in a sorted and rotated array
02, Jul 13
Closest greater element for every array element from another array
22, Nov 17
Array formed from difference of each element from the largest element in the given array
04, Feb 20
Recursive Programs to find Minimum and Maximum elements of array
18, Jun 17
Find the minimum and maximum sum of N-1 elements of the array
07, Apr 20
Find a number such that maximum in array is minimum possible after XOR
30, Apr 20
Queries to find the maximum and minimum array elements excluding elements from a given range
03, Feb 21
Minimize maximum array element possible by at most K splits on the given array
31, Mar 21
Min difference between maximum and minimum element in all Y size subarrays
13, Jul 20
Rearrange array to make it non-decreasing by swapping pairs having GCD equal to minimum array element
23, Sep 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
rithika palaniswamy
@rithika palaniswamy
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox