The time complexity of an algorithm to compute M1 × M2 will be

YasminRadwan26

Save to bookmark

2022-05-29

725

Two matrices M1 and M2 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.

best if A is in row-major, and B is in column- major order
best if both are in row-major order
best if both are in column-major order
independent of the storage scheme

Algorithms, MCQ Questions, Algorithms MCQ-questions,

All Answers

YasminRadwan26

2022-05-29

need an explanation for this answer? contact us directly to get an explanation for this answer

Correct Answer:

independent of the storage scheme

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

The time complexity of an algorithm to compute M1 × M2 will be

All Answers

This question belongs to these collections

Similar questions

need a help?

find thousands of online teachers now