Consider the problem of neatly printing a paragraph on a printer. The
input text is a sequence of n words of lengths l1, l2, l3, ……,ln,
measured in characters. We want to print this paragraph neatly on a
number of lines that hold a maximum of M characters each. Our
criterion of “neatness” is as follows. If given line contains words i
through j, where i ≤ j, and we leave exactly one space between words,
the number of extra space characters at the end of the line is M – j +
i – Σj{k=i} lk, which must be non-negative so that words fit on a
line. We wish to minimize the sum, over all lines except the last, of
the numbers of extra space characters at the ends of the lines. Design
an algorithm to print a paragraph of n words neatly on a printer.-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
