(30%) Assume you have a multidimensional array M x N and you wish to write a...

Transcribed Image Text:

(30%) 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 sumArray (int ( ) ( ) array) { int sum, count = 0 ; for (int i = 0; i < array[0].length; i++) for (j = 0; j < array.length; j++) return sum; sum += a[i][j]; 'm } OR: b) int sumArray (int[] [] array) { wwwwwwmo int sum = 0; for (int i = 0; i < array.length; w w wwwwwwwoom i++) www. for (j = 0; j < array [0].length; j++) sum += a[i][j]; return sum; } Which approach will be faster and why (you can assume each row is contiguous in memory)? (30%) 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 sumArray (int ( ) ( ) array) { int sum, count = 0 ; for (int i = 0; i < array[0].length; i++) for (j = 0; j < array.length; j++) return sum; sum += a[i][j]; 'm } OR: b) int sumArray (int[] [] array) { wwwwwwmo int sum = 0; for (int i = 0; i < array.length; w w wwwwwwwoom i++) www. for (j = 0; j < array [0].length; j++) sum += a[i][j]; return sum; } Which approach will be faster and why (you can assume each row is contiguous in memory)?