Question: You are provided the following algorithm for word wrapping: SpaceLeft := Linewidth for each Word in Text if ( Length(word)>LineWidth) Break the word till it

You are provided the following algorithm for word wrapping: SpaceLeft := Linewidth for each Word in Text if ( Length(word)>LineWidth) Break the word till it reaches the length of line and place line break Word-remaining text from word if (Length(Word) SpaceWidth) > SpaceLeft Insert line break before the word in text SpaceLeft := Linewidth-Length(Word) else SpaceLeft SpaceLeft-(Length(Word) + SpaceWidth) Provide a proof of optimality that contains 1. The greedy choice property 2. Optimal substructure
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
