-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathExercise08_13.java
More file actions
46 lines (39 loc) · 1.44 KB
/
Copy pathExercise08_13.java
File metadata and controls
46 lines (39 loc) · 1.44 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
import java.util.Scanner;
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author jorda
*/
public class Exercise08_13 {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.print("Enter the number of columns of the array: ");
double[][] array = new double[input.nextInt()][input.nextInt()];
System.out.print("Enter the array: ");
for (int row = 0; row < array.length; row++) {
for (int col = 0; col < array[row].length; col++) {
array[row][col] = input.nextDouble();
}
}
int[] largestIndex = locateLargest(array);
System.out.println("The location of the largest element is at (" + largestIndex[0] + ", " + largestIndex[1] + ")");
}
public static int[] locateLargest(double[][] array){
double largest = array[0][0];
int[] largestIndex = {0, 0};
for (int row = 0; row < array.length; row++) {
for (int col = 0; col < array[row].length; col++) {
if(array[row][col] > largest){
largest = array[row][col];
largestIndex[0] = row;
largestIndex[1] = col;
}
}
}
return largestIndex;
}
}