Next:
Up:
Previous:
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.
Next:
Up:
Previous: