Adv. Algorithms & Data Structures Sorting SelectionSort

Adv. Algorithms & Data Structures

SelectionSort

Selection sort is another sorting algorithm that is similar to bubble sort in that it's simpler to implement but has it has O(n^2), it's not as efficient. You'll later implement other more efficient sorting algorithms than selection sort, but as selection sort is simpler to implement than other sorting methods and as implementing this will give you a good foundation to implement other more advanced sorting algorithms, we want you to practice how this is implemented.

There are a few different ways to implement SelectionSort but for this particular challenge, start from the first value in the array and find the minimum value in the array. Then move that minimum value in the beginning of the array. Repeat this process until the array is sorted. Watch the video for more in depth explanation about this is to be done.

Below is a Wikipedia diagram that illustrates how this is done. You could alternative watch the video below.

SelectionSort

Red is current min. Yellow is sorted list. Blue is current item.

(0/3) Solved

function selectionSort(arr){

1
2
3
// Enter code below
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Test Cases (0/3)

selectionSort([5,7,0]) to return [0,5,7]
selectionSort([5,7,0,-10]) to return [-10,0,5,7]
selectionSort([5,7,0,-10,4]) to return [-10,0,4,5,7]

Output

Michael

Test Cases (0/3)

Output

Run Your Code

Run Your Code

Community Tab