Finish sorting

Program for sorting an array of four elements is ready. Yes, it is inflexible, and it will have to be rewritten for arrays with a different number of elements. But you will be fine, because you already know how to do refactoring.

In the current implementation, there is a lot of repeating code where only the value of variable currentIndex changes. How to make the structure of the program better?

You can take a piece of code with a loop that searches and inserts a minimum value to the specified location, and wrap it in another loop. And in this upper, parent loop, increase variable currentIndex.

Yes. Loops can be nested into each other.

Note that currentIndex should change not from zero to array length, but from zero array length minus one. Let’s recall the previous task where we finished sorting of the array after reaching the second last element (because the last element automatically turned out to be the maximum one).

Let’s write the condition to exit the upper loop by analogy with the condition to exit the nested loop:

// Loop to the second last element
currentIndex <= usersByDay.length - 2

// Loop to the last element
j <= usersByDay.length - 1