C++ Problem

There will not be more than 80 formulations (row) and not more than 10 locations (column):

C++ Problem

One function should accept the 2-dimensional array, the number of formulations and number of locations then create a 1-dimensional array containing the minimum resistances for each formulation and create a 1-dimensional array containing the maximum resistances for each formulation. This function should call the function to output a 1-dimensional array once for the minimum and once for the maximum values before sending these arrays back to the function call.