2 votes 2 votes Is there any shortcut or Trick to get min number of multiplication faster? I mean if we could know the right split. Algorithms algorithms dynamic-programming matrix-chain-ordering + – Nivedita Singh asked Dec 8, 2018 Nivedita Singh 1.5k views answer comment Share Follow See 1 comment See all 1 1 comment reply yashhoskere commented Oct 7, 2020 reply Follow Share No there is no shortcut possible in general. There may be specific shortcuts but not worth learning.If there was indeed one ,dynamic programming would not be required and the shortcut would have been used.Better practice the conditions its pretty easy itself . 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes Yes there is with this formula :(2n)!/((n+1)! * n!) n=no of matrices-1 Doraemon answered Mar 26, 2019 Doraemon comment Share Follow See 1 comment See all 1 1 comment reply kd..... commented Nov 28, 2019 reply Follow Share It doesn't give optimal parenthesis it will just give the ways of paranthesing 2 votes 2 votes Please log in or register to add a comment.
0 votes 0 votes Yes We used a formula to find how many different way to multiply a matrix Himanshu Kumar Gupta answered Sep 8, 2020 Himanshu Kumar Gupta comment Share Follow See 1 comment See all 1 1 comment reply yashhoskere commented Oct 7, 2020 reply Follow Share He is asking for a shortcut to find the optimum split in short time and not the total number of splits possible. Yours formula is for total number of parathesis possible. 0 votes 0 votes Please log in or register to add a comment.