Consider the following procedure.
procedure two_dim_arr(a,b: two-dimensional arrays with a as 𝑚×𝑘) and b as 𝑘×𝑛) for i := 1 to m for j := 1 to n cij := 0 for q := 1 to k cij := cij + aiq bqj
return c{c = [cij] two-dimensional array of elements cij}
Show all your work as you determine the Big-O of this given procedure.
Mathbot Says...
I wasn't able to parse your question, but the HE.NET team is hard at work making me smarter.