Solution Review: Sorting From 1 to n

First solution

This solution consists of two nested loops. The outer loop will replace the value at index i with -1. The inner loop will do the following:

• Store the current value temporarily.
• Set the required value at the proper index.
• Set value for the next iteration.
• Set the cursor for the next iteration.

Let’s look more through illustrations.