The words get arranged one by one on the basis of the number of letters, the word with least number of words gets arranged first. If the number of letters is the same, the word that comes first in the dictionary gets arranged first. While one word gets arranged. The others shift rightwards.step I: If there was no good man
Step II: if no there was good manStep III: if no man there was good

In each step the fourth word becomes first word and the last word becomes fourth word and all other words shift one place rightwards except the third, which shifts two place rightwards.In order to make things easier, let us represent the words digitally from 1 to 7. Then we have:Input:    1 2 3 4 5 6 7Step I:    4 1 2 7 3 5 6Step II:   7 4 1 6 2 3 5Step III:  6 7 4 5 1 2 3Step IV:  5 6 7 3 4 1 2Step V:   3 5 6 2 7 4 1Step VI:  2 3 5 1 6 7 4

In each step the fourth word becomes first word and the last word becomes fourth word and all other words shift one place rightwards except the third, which shifts two place rightwards.In order to make things easier, let us represent the words digitally from 1 to 7. Then we have:Input:    1 2 3 4 5 6 7Step I:    4 1 2 7 3 5 6Step II:   7 4 1 6 2 3 5Step III:  6 7 4 5 1 2 3Step IV:  5 6 7 3 4 1 2Step V:   3 5 6 2 7 4 1Step VI:  2 3 5 1 6 7 4Step V: so cd rom lay is nor it3 5 6 2 7 4 1Step II: 7 4 1 6 2 3 5is nor it rom lay so cd

In each step the fourth word becomes first word and the last word becomes fourth word and all other words shift one place rightwards except the third, which shifts two place rightwards.In order to make things easier, let us represent the words digitally from 1 to 7. Then we have:Input:    1 2 3 4 5 6 7Step I:    4 1 2 7 3 5 6Step II:   7 4 1 6 2 3 5Step III:  6 7 4 5 1 2 3Step IV:  5 6 7 3 4 1 2Step V:   3 5 6 2 7 4 1Step VI:  2 3 5 1 6 7 4Step III: lo men chi from yet as know6 7 4 5 1 2 3Input: 1 2 3 4 5 6 7yet as know chi from lo men

In each step the fourth word becomes first word and the last word becomes fourth word and all other words shift one place rightwards except the third, which shifts two place rightwards.In order to make things easier, let us represent the words digitally from 1 to 7. Then we have:Input:    1 2 3 4 5 6 7Step I:    4 1 2 7 3 5 6Step II:   7 4 1 6 2 3 5Step III:  6 7 4 5 1 2 3Step IV:  5 6 7 3 4 1 2Step V:   3 5 6 2 7 4 1Step VI:  2 3 5 1 6 7 4Input: say not you are only wise yet 1 2 3 4 5 6 7Arrangement: not you only say wise yet are Step VI: 2 3 5 1 6 7 4

In each step the fourth word becomes first word and the last word becomes fourth word and all other words shift one place rightwards except the third, which shifts two place rightwards.In order to make things easier, let us represent the words digitally from 1 to 7. Then we have:Input:    1 2 3 4 5 6 7Step I:    4 1 2 7 3 5 6Step II:   7 4 1 6 2 3 5Step III:  6 7 4 5 1 2 3Step IV:  5 6 7 3 4 1 2Step V:   3 5 6 2 7 4 1Step VI:  2 3 5 1 6 7 4

The words are arranged according to the number of letters they have, one at a time. The word with the maximum number of letters is put first. If two words have the same number of letter, we go alphabetical arrangement.Input: the in car as he may meStep I: car the in as he may meStep II: car may the in as he meStep III: car may the as in the me

The words are arranged according to the number of letters they have, one at a time. The word with the maximum number of letters is put first. If two words have the same number of letter, we go alphabetical arrangement.Input: more fight cats cough sough acts ideaStep I: cough more fight cats sough acts ideaStep II: cough fight more cats sough acts ideaStep III: cough fight sough more cats acts ideaStep IV: cough fight sough acts more cats ideaStep V: cough fight sough acts cats more ideaStep VI: cough fight sough acts cats idea more

The words are arranged according to the number of letters they have, one at a time. The word with the maximum number of letters is put first. If two words have the same number of letter, we go alphabetical arrangement.Step II: clever remand window sales batch tiger neverStep III: clever remand window batch sales tiger neverStep IV: clever remand window batch never sales tigerNow, step IV would be the last step.

The words are arranged according to the number of letters they have, one at a time. The word with the maximum number of letters is put first. If two words have the same number of letter, we go alphabetical arrangement.input: true se veto be nuke my like
Step I: like true se veto be nuke myStep II: like nuke true se veto be myStep III: like nuke true veto se be myStep IV: like nuke true veto be se my