Recursively

We'd usually solve this problem recursively, but the proposed solution uses an iterative algorithm.

After recursively sorting the two subsets, the situation is (11,28) 35 (45,50,62) and an append of the three pieces gives the final result.

In the same computation, the computer may be decomposed repeatedly and the partitioning may vary from one split to the other. The submachines can further recursively decompose […]