Theory
Theory
Comments

Starting sorting

We learned how to find the minimum value. Why not take another step.

Now let’s not just calculate the minimum value after the first element, but write this value into the place of the first element. To do this, you need to add a little to the algorithm:

Add variable minValue to store the minimum value.
Suppose that the first element is the minimum one. Therefore, let’s store the value of the first element in minValue before the loop.
At each iteration of the loop, we compare the current element with minValue value.
If the current element is less than minValue, write it into minValue and then swap the value of the first element and of the current one.

After the loop is completed, the element with the minimum value will appear in the first position of the array. All other elements will be larger.

script.js

JavaScript

var usersByDay = [4, 2, 1, 3]; console.log(usersByDay); var currentIndex = 0; var minValue = usersByDay[currentIndex]; for (var j = currentIndex + 1; j <= usersByDay.length - 1; j++) { if (usersByDay[j] < minValue) { minValue = usersByDay[j]; } } console.log('Minimum element: ' + minValue);

Goalscompleted

Inside the condition after the variable minValue, save the value usersByDay[currentIndex] to variable swap. Write the remaining code inside the condition.
On the next line in usersByDay[currentIndex], write down the minimum value.
Then write value of variable swap in usersByDay[j].
On the next line, log in the console: 'Swapping ' + swap + ' and ' + minValue.
Below, log in the console: 'Current array: ' + usersByDay.

Starting sorting

Comments

Result

Log in

Sign up

Restore access