Assume you have a multidimensional array M x N and you wish to write a function that produces an average of the items in the entire array using a sum/count approach. You have two alternatives:

a)

int averageArray(int[][] array){

int sum, count = 0;

for (int i = 0; i < array.length; i++)

for (j = 0; j < array[0].length; j++)

sum += a[i][j];

count++;

return sum/count;

}

OR:

b)

int averageArray(int[][] array){

int sum, count = 0;

for (int i = 0; i < array[0].length; i++)

for (j = 0; j < array.length; j++)

sum += a[i][j];

count++;

return sum/count;

}

Which approach will be faster and why (you can assume each row is contiguous in memory)?