程序以查找数组中的最大元素

给定一个数组，在其中找到最大的元素。
例子：

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

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

解决方案是将max初始化为第一个元素，然后从第二个元素遍历给定的数组直至结束。对于每个遍历的元素，将其与max进行比较，如果它大于max，则更新max。

C++

// C++ program to find maximum
// in arr[] of size n
#include 
using namespace std;
 
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;
}
 
// Driver Code
int main()
{
    int arr[] = {10, 324, 45, 90, 9808};
    int n = sizeof(arr) / sizeof(arr[0]);
    cout << "Largest in given array is "
         << largest(arr, n);
    return 0;
}
 
// This Code is contributed
// by Shivi_Aggarwal

C

// C program to find maximum in arr[] of size n
#include 
 
// 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):
 
    # return max using max 
    # inbuilt max() function
    return (max(arr))
 
# Driver Code
arr = [10, 324, 45, 90, 9808]
n = len(arr)
 
#calculating length of an array
 
Ans = largest(arr,n)
 
#display max
print ("Largest in given array is",Ans)
 
# This code is contributed by Jai Parkash Bhardwaj

C#

// C# Program to find maximum in arr[]
using System;
 
class GFG {
     
    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()
    {
        Console.WriteLine("Largest in given "
                  + "array is " + largest());
    }
}
 
// This code is contributed by anuj_67.

PHP

 $max)
            $max = $arr[$i];
 
    return $max;
}  
     
    // Driver Code
    $arr= array(10, 324, 45, 90, 9808);
    $n = sizeof($arr);
    echo "Largest in given array is "
                 , largest($arr, $n);
     
// This code is contributed by aj_36
?>

Javascript

 
// JavaScript program to find
// maximum in arr[] of size n
   
    function largest(arr) {
        let i;
       
        // Initialize maximum element
        let 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 code
    let arr = [10, 324, 45, 90, 9808];
    document.write("Largest in given array is " + largest(arr));
     
 // This code is contributed by Surbhi Tyagi 
  

输出：

Largest in given array is 9808

使用库函数：
我们在C++中使用std :: max_element。

C++

// C++ program to find maximum in arr[] of size n
#include 
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;
}

Java

// Java program to
// find maximum in
// arr[] of size n
import java .io.*;
import java.util.*;
 
class GFG
{
     
    // returns maximum in
    // arr[] of size n
    static int largest(int []arr,  
                       int n)
    {
        Arrays.sort(arr);
        return arr[n - 1];
    }
 
    // Driver code
    static public void main (String[] args)
    {
        int []arr = {10, 324, 45,
                     90, 9808};
        int n = arr.length;
        System.out.println(largest(arr, n));
    }
}
 
// This code is contributed
// by anuj_67.

Python3

# Python 3 program to find
# maximum in arr[] of size n
 
# returns maximum
# in arr[] of size n
def largest(arr, n):
 
    return max(arr)
 
# driver code
arr = [10, 324, 45, 90, 9808]
n = len(arr)
 
print(largest(arr, n))
 
# This code is contributed by
# Smitha Dinesh Semwal

C＃

// C# program to find maximum in
// arr[] of size n
using System;
using System.Linq;
 
public class GFG {
     
    // returns maximum in arr[] of size n
    static int largest(int []arr, int n)
    {
        return arr.Max();
    }
 
    // Driver code
    static public void Main ()
    {
        int []arr = {10, 324, 45, 90, 9808};
        int n = arr.Length;
        Console.WriteLine( largest(arr, n));
    }
}
 
// This code is contributed by anuj_67.

Java脚本

 
// Javascript program to find maximum in arr[] of size n
 
// returns maximum in arr[] of size n
function largest(arr, n)
{
    arr.sort();
    return arr[n-1];
}
 
    let arr = [10, 324, 45, 90, 9808];
    let n = arr.length;
    document.write(largest(arr, n));
  
 
//This code is contributed by Mayank Tyagi
 

输出 ：

9808

上述解决方案的时间复杂度为$\Theta(n)$ 。