Page 41, Exercise 6

Program 1.22 multiplies a 2-dimensional array. It requires 3-nested loops each iteratint n times. The time is n•n•n; therefore the worst case time is O(n³). Strassen's Matrix Multiplication method reduces the complexity to : O(n^2.76).