Introduction
The Selection sort is another easy algorithm for you to learn about.
How it works
The Selection Sort algorithm works by finding the smallest element and switching it with the element that was in its position.
Example
function selectionSort(arr) {
for (let i = 0; i < arr.length; i++) {
let min = i;
for (let j = i + 1; j < arr.length; j++) {
if (arr[j] < arr[min]) {
min = j;
}
}
if (min !== i) {
const temp = arr[i];
arr[i] = arr[min];
arr[min] = temp;
}
}
return arr;
}
console.log(selectionSort([10, 2, 6, 3, 1, 20, 5]));
Lesson task
Goal
For you to be able to write a Selection sort on your own.
Brief
Complete the Level 1 process.
NOTE: Lesson tasks do not get submitted on Moodle and are not assessed by tutors. They are mainly there for you to practise what you have learned in the lesson.
Level 1 process
-
Read through and run the example code, console logging where you’d like to get a better understanding.
-
Once you have a good understanding, try to recreate the Selection sort on your own.