Program to find largest element in an array

1.1

Given an array, find the largest element in it.

Input : arr[] = {10, 20, 4}
Output : 20

Input : arr[] = {20, 10, 20, 4, 100}
Output : 100

The solution is to initialize max as first element, then traverse the given array from second element till end. For every traversed element, compare it with max, if it is greater than max, then update max.

C

// C program to find maximum in arr[] of size n 
#include <stdio.h>

// C function to find maximum in arr[] of size n
int largest(int arr[], int n)
{
    int i;
   
    // Initialize maximum element
    int max = arr[0];

    // Traverse array elements from second and
    // compare every element with current max  
    for (i = 1; i < n; i++)
        if (arr[i] > max)
            max = arr[i];

    return max;
}

int main()
{
    int arr[] = {10, 324, 45, 90, 9808};
    int n = sizeof(arr)/sizeof(arr[0]);
    printf("Largest in given array is %d", largest(arr, n));
    return 0;
}

Java

// Java Program to find maximum in arr[] 
class Test
{
     static int arr[] = {10, 324, 45, 90, 9808};
     
     // Method to find maximum in arr[]
     static int largest()
     {
         int i;
         
         // Initialize maximum element
         int max = arr[0];
      
         // Traverse array elements from second and
         // compare every element with current max  
         for (i = 1; i < arr.length; i++)
             if (arr[i] > max)
                 max = arr[i];
      
         return max;
     }
     
     // Driver method
     public static void main(String[] args) 
     {
         System.out.println("Largest in given array is " + largest());
        }
 }

Python3

# Python3 program to find maximum
# in arr[] of size n 

# python function to find maximum
# in arr[] of size n
def largest(arr,n):

    # Initialize maximum element
    max = arr[0]

    # Traverse array elements from second
    # and compare every element with 
    # current max
    for i in range(1, n):
        if arr[i] > max:
            max = arr[i]
    return max

# Driver Code
arr = [10, 324, 45, 90, 9808]
n = len(arr)
Ans = largest(arr,n)
print ("Largest in given array is",Ans)

# This code is contributed by Smitha Dinesh Semwal


Output:
Largest in given array is 9808

Using Library Function :
We use std::max_element in C++.

C++

// C++ program to find maximum in arr[] of size n 
#include <bits/stdc++.h>
using namespace std;

// returns maximum in arr[] of size n
int largest(int arr[], int n)
{
    return *max_element(arr, arr+n);
}

int main()
{
    int arr[] = {10, 324, 45, 90, 9808};
    int n = sizeof(arr)/sizeof(arr[0]);
    cout << largest(arr, n);
    return 0;
}


Output :
9808

Time complexity of the above solution is Theta(n).

Refer below article for more methods.
Program to find the minimum (or maximum) element of an array

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

GATE CS Corner    Company Wise Coding Practice

Recommended Posts:



1.1 Average Difficulty : 1.1/5.0
Based on 33 vote(s)