Given a 2D array called ARR[row index][column index] of size 4x3 (rows x columns), construct an algorithm to output a new 1D array called BIGGEST containing the biggest number in each row. The algorithm must also work for a 2D array containing only negative numbers.
For example, consider the following 2D array:
The correctly functioning algorithm applied to the 2D array above yields the following 1D array:
Short Answer6 MarksPremium
36 Uses49 Views2 Likes
Login or Create an Account to view the mark scheme, comment, and add to a test