const result = (data) => {
let max = 0;
for (let i = 0; i < data.length; i++) {
if (data[i] > max) {
max = data[i];
}
}
console.log("===> :: max", max);
}
const inputData = [2, 3, 5, 4, 54, 69, 4, 44, 3, 6, 45, 6, 4, 6]
result(inputData);const array = [3 , 6, 2, 56, 32, 5, 89, 32];
let largestNum= array[0];
for (let i=1; i<array.length; i++){
if (array[i]>largestNum) {
largestNum = array[i];
}
};
console.log(largestNum);const numbers = [
[1, 2, 3],
[4, 5, 6],
[7, 8, 9, 10, 11],
];
let largestArray = numbers[0].length;
for (let i = 1; i < numbers.length; i++) {
if (numbers[i].length > largestArray) {
largestArray = numbers[i];
for (let j = 0; j < largestArray.length; j++) {
console.log(numbers[i][j]);
}
}
}
//it will print 7, 8, 9, 10, 11 as these numbers are in largest array;import java.util.*;
public class tuf {
public static void main(String args[]) {
int arr1[] = {2,5,1,3,0};
System.out.println("The Largest element in the array is: " + sort(arr1));
int arr2[] = {8,10,5,7,9};
System.out.println("The Largest element in the array is: " + sort(arr2));
}
static int sort(int arr[]) {
Arrays.sort(arr);
return arr[arr.length - 1];
}
}