Sorry, your code does not pass. Don’t give up.
After your nested for loop, you should declare a temp variable.
const selectionSort = (array) => {
for (let i = 0; i < array.length; i++) {
let minIndex = i;
for (let j = i + 1; j < array.length; j++) {
console.log(array, array[j], array[minIndex])
if (array[j] < array[minIndex]) {
minIndex = j;
}
}
// Swap values if minIndex is not equal to i
if (minIndex !== i) {
const temp = array[i];
array[i] = array[minIndex];
array[minIndex] = temp;
}
}
}
WARNING
The challenge seed code and/or your solution exceeded the maximum length we can port over from the challenge.
You will need to take an additional step here so the code you wrote presents in an easy to read format.
Please copy/paste all the editor code showing in the challenge from where you just linked.
Replace these two sentences with your copied code.
Please leave the ``` line above and the ``` line below,
because they allow your code to properly format in the post.
Your browser information:
User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/122.0.0.0 Safari/537.36 Edg/122.0.0.0
Challenge Information:
Learn Basic Algorithmic Thinking by Building a Number Sorter - Step 27