The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
38 views

 

If Brute force recursive approach is used to find all the possible ways of multiplying the given set of n matrices the what is the time complexity of this approach?

  1. O(n2)O(n2)
  2. O(n3)O(n3)
  3. O(n4)O(n4)
  4. None of the above
asked in Algorithms by Active (1.5k points) | 38 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,408 questions
53,589 answers
185,805 comments
70,871 users