Consider the below algorithm for matrix multiplication of two nx n matrices. Obtain running times for a range of values of n(suitable to obtain a nice graph) and plot the times. Use a clockfunction with good resolution. Make sure no I/O is included in thetimed program section.
Algorithm Mult (a,b,c,n)
{
for i:= 1 to n do
for j:= 1 to n do
{
c[i,j] := 0;
for k:= 1 to n do
c[i,j] := c[i,j] + a[i,k] * b[k,j];
}
}
Expert Answer
An answer will be send to you shortly. . . . .