Given a two dimensional square matrix int[][] arr of size n x n where n could be

ID: 3730085 • Letter: G

Question

Given a two dimensional square matrix int[][] arr of size n x n where n could be any integer greater than 1, develop the following methods:

1. public void columnMins(int [] [] arr) that prints the minimum value in each column, comma separated on a single line.

Example: If the matrix is

then rowSums() method will print 10, 5, 18 and columnMins() will print 1,0,4

For testing purposes, you may initialize the matrix with values from a formula such as the ones we discussed in class, e.g., arr[i][j] = i+j;

3 2 5 1 0 4 5 6 7

public class Test {

public static void columnMins(int [][] arr){

int n = arr.length;

for(int i=0; i<n; i++) {

int min = arr[0][i];

for(int j=0; j<n ; j++) {

if(arr[j][i] < min)

min = arr[j][i];

}

if(i == n-1)

System.out.println(min);

else

System.out.print(min+", ");

}

public static void main(String[] args) {

int arr[][] = {

{3, 2, 5},

{1, 0, 4},

{5, 6, 7}

};

columnMins(arr);

}

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.