Next:
Dynamic Programming Solution (4
Up:
CSE 2320: Algorithms and
Previous:
Matrix Multiplication Parenthesization
Brute Force Solution: Try all possible parenthesizations
How many?
?
P(n)
P(k)*P(n-k), k = 1 to (n-1)
See Cormen et al., Problem 13-4 for solving this recurrence.
P(n) =
=
, which is exponential in n.
Copyright © 1998 The University of Texas at Arlington