In this problem. we would like to break a sequence of words into a series of lin

Question

In this problem. we would like to break a sequence of words into a series of lines to form paragraph. Our objective is to ovoid extra spices on any line. The order of words must be maintained as they are pieced on lines. Assume o sequence of n words of length wl. w2, w3.....wn and o line width of W. The constraint in this problem is that, if a line contains word I through word j, then wi+.. +wj+(j-i)k=W. Note that the term j-I corresponds to the number of spoces required to separate the words. We define an objective as follows; The cost associated for each line is the number of extra spaces on the line: F = w- wi+..+wj+(j-i) Give a greedy algorithm for this problem and analyze its time complexity.

Explanation / Answer

Hi i have solved this question in my notebook, but i can't type it and post it here because there's no time... please rate me lifesaver and i'll make sure the answer is in your inbox! i don't do this generally but i am doing this due to lack of time...

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.