On Sat, May 03, 2014 at 02:23:10PM -0400, Peter Schaffter wrote:
>
> I suspect I'm a voice crying in the wilderness here, but we need to
> consider that a greedy algorithm is almost always faster than a
> dynamic programming solution; furthermore, greedy algorithms
> sometimes lead to optimal solu
On Fri, Apr 25, 2014, Doug McIlroy wrote:
> Equations and displayed quotations are not a problem for the line-breaking
> algorithm; they'd all be handled in the macro packages, which would have
> the duty to delimit the blocks of text that are to be treated unitarily.
>
> But that doesn't mean we'
