Ticket #11 (closed defect)
|Reported by:||dherman||Owned by:||dherman|
Graham Hughes wrote:
that particular pretty printing algorithm is exponential time when it could be O(n2) using dynamic programming (I think). Anyway, the sheer amount of time required to do even relatively simple things was prohibitive and I have had to remove most of the nondeterminism (and thus most of the pretty printing) to make it output reasonable files.
(Dave: I believe he was talking about the 2.x version of the algorithm.)