1. Computer Science Engineering (CSE)
  2. Design and Analysis of Algorithms
  3. Consider the brute force implementation ...
Q.

Consider the brute force implementation in which we find all the possible ways of multiplying the given set of n matrices. What is the time complexity of this implementation?

A. o(n!)
B. o(n3)
C. o(n2)
D. exponential
Answer» D. exponential
Explanation: the time complexity of finding all the possible ways of multiplying a set of n matrices is given by (n-1)th catalan number which is exponential.

Discussion