Dada una array arr de tamaño N , la tarea es encontrar el elemento más grande en la array dada.
Ejemplo:
Entrada: arr[] = {10, 20, 4}
Salida: 20Entrada: arr[] = {20, 10, 20, 4, 100}
Salida: 100
Enfoque 1: recorrido lineal: uno de los enfoques más simples y básicos para resolver este problema es simplemente recorrer toda la lista y encontrar el máximo entre ellos.
Siga los pasos a continuación para implementar esta idea:
- Cree una variable local max para almacenar el máximo entre la lista
- Inicialice max con el primer elemento inicialmente, para comenzar la comparación.
- Luego recorra la array dada desde el segundo elemento hasta el final, y para cada elemento:
- Comparar el elemento actual con max
- Si el elemento actual es mayor que max, reemplace el valor de max con el elemento actual.
- Al final, devuelva e imprima el valor del elemento más grande de la array almacenado en max .
A continuación se muestra la implementación del enfoque anterior:
C++
// C++ program to find maximum
// in arr[] of size n
#include <bits/stdc++.h>
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 <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
# Function to find maximum
# in arr[] of size n
def largest(arr,n):
# Initialize maximum element
mx = arr[0]
# Traverse array elements from second
# and compare every element with
# current max
for i in range(1, n):
if arr[i] > mx:
mx = arr[i]
return mx
# 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
# and improved by prophet1999
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
<?php
// PHP program to find maximum
// in arr[] of size n
// PHP function to find maximum
// in arr[] of size n
function largest($arr, $n)
{
$i;
// Initialize maximum element
$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
$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
<script>
// 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
</script>
Producción
Largest in given array is 9808
Complejidad temporal: O(N), para atravesar el Array completamente.
Espacio Auxiliar: O(1), ya que solo se crea una variable extra, que ocupará el espacio O(1).
Enfoque 2: uso de la función de biblioteca: la mayoría de los lenguajes tienen una función incorporada de tipo max() relevante para encontrar el elemento máximo, como std::max_element en C++ . Podemos usar esta función para encontrar directamente el elemento máximo.
A continuación se muestra la implementación del enfoque anterior:
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;
}
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[]
static int Largest(int[] arr)
{
return arr.Max();
}
// Driver code
static public void Main ()
{
int[] arr = {10, 324, 45, 90, 9808};
Console.WriteLine(Largest(arr));
}
}
// This code is contributed by anuj_67.
// Minor code cleanup by shanmukha7
PHP
<?php
// PHP program to find maximum
// in arr[] of size n
// returns maximum in
// arr[] of size n
function largest( $arr, $n)
{
return max($arr);
}
// Driver COde
$arr = array(10, 324, 45, 90, 9808);
$n = count($arr);
echo largest($arr, $n);
// This code is contributed by anuj_67.
?>
Javascript
<script>
// 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
</script>
Producción
9808
Complejidad de tiempo: O(N), ya que la función incorporada max_element() toma tiempo O(N).
Espacio Auxiliar: O(1), ya que solo se crea una variable extra, que ocupará el espacio O(1).
Consulte el artículo a continuación para obtener más métodos: Programa para encontrar el elemento mínimo (o máximo) de una array
Publicación traducida automáticamente
Artículo escrito por GeeksforGeeks-1 y traducido por Barcelona Geeks. The original can be accessed here. Licence: CCBY-SA