What logic would you use to find the largest number in an unsorted two-dimensional integer array?

Answer 1

Just go through every elements in 2D integer array to select the maximum value.
Ex (code in C++):

int max = a[0][0];
for (int i=0; i for (int j=0; j {
if (max < a[i][j])
max = a[i][j];
}

Answer 2

that's not that complicated. in spite of the undeniable fact that it quite is a 2-dimensional array, you're in uncomplicated terms getting access to one ingredient of the 1st array. so which you cope with it basically like a known array. the only distinction is that interior the for loop, rather of array[i], you will possibly use array[a million][i], or something comparable.