Algorithym

Analyze the following code fragment mathematically and determine whether the order of growth of the running time is linear, quadratic, or cubic as a function of n.

for (int i = 0; i < n; i++)

for (int j = 0; j < n; j++)

for (int k = 0; k < n; k++)

c[i][j] += a[i][k] * b[k][j];