Understanding sequential solution for the TAOCP 3 Million Men problem
With a for loop that steps through the array and creates a new pair from the $i$th and $(i+2)$th elements, for each $i$.
The same as the merge step in merge sort.
There are no "otherwise"s in the statement in English, so there should be no else statements.