На тази задача не и разбирам първата част с подреждането:
Reorder: The reordering operation over n words is performed by sequentially moving the words at positions 0, 1, …, n-1 to positions corresponding to their lengths. More precisely, first the word w0 from position 0 is moved to position len(w0) % (n+1), then the word w1 from position 1 is moved to position len(w1) % (n+1), and so on. Finally the word wn-1 from position n-1 is moved to position len(wn-1) % (n+1). Note that positions are numbered from 0 to n and position 0 is just before the leftmost word and position n is just after the rightmost word.
Малко разяснение..... ?