|
|
|
| Keep It Simple, Stupid | |
| PerlMonks |
Re(2): Puzzle: need a more general algorithmby FoxtrotUniform (Prior) |
| on Jul 09, 2002 at 16:39 UTC ( #180537=note: print w/replies, xml ) | Need Help?? |
|
Impressive. Once you have the minimum height, calculating the actual partition is equivalent to the text justification problem, with each category being a word, its length being the word's length, and the minimum height being the line length. This has been done before. --
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||||||