for Example:
Suppose user has opted the array with it's element which is below. we must do three steps:
first step:
Find the smallest number which is in this example (3) then move the index of the smallest number three times to forward the change the number in current index which is (10) to 0 and do this while you arrived to the end of the array
note: When you arrived to the end of the array move the index of array to the beginning of that . and if the begging of the array had been changed to 0 in this case you must move the index of array just once to forward
| 8 | 7 | 4 | 3 | 9 | 12 | 0 | 16 | 13 | 0 |
second step:
Continue the first Step but in this step we must not find the smallest number of array
note: When you arrive to the place of array that had been changed to 0 please underestimate to count this in the index movement.
| 8 | 7 | 0 | 3 | 9 | 0 | 0 | 16 | 13 | 0 |
Third step:
Continue the second step
note: When you arrive to the place of array that had been changed to 0 please underestimate to count this in the index movement.
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 16 | 0 | 0 |
Print the 16 to the Unleashed Number
Replies
Know the answer? Post it — somebody with the same question will find it here.