Q39

MCQ2 marks, −0.5

Two matrices $M_1$ and $M_2$ are to be stored in arrays $A$ and $B$ respectively. Each array can be stored either in row-major or column-major order in contiguous memory locations. The time complexity of an algorithm to compute $M_1 \times M_2$ will be

(A)

best if $A$ is in row-major, and $B$ is in column-major order

(B)

best if both are in row-major order

(C)

best if both are in column-major order

(D)

independent of the storage scheme

Loading…