Learn Basic Algorithmic Thinking by Building a Number Sorter - Step 38

Tell us what’s happening:

I wrote this solution to solve the challenge but still not passing. Need a clue to solve array manipulation missing something here.

Your code so far

<!-- file: index.html -->

/* file: script.js */
// User Editable Region

const insertionSort = (array) => {
  for (let i = 1; i < array.length; i++) {
    const currValue = array[i];
    let j = i - 1;

    while (j >= 0 && array[j] > currValue) {
      **array[j] = array[j + 1];** Here is what i wrote
      j--;
    }
  }
}

// User Editable Region
/* file: styles.css */

Your browser information:

User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/129.0.0.0 Safari/537.36

Challenge Information:

Learn Basic Algorithmic Thinking by Building a Number Sorter - Step 38

Do so by assigning the value at the j index to the next index.

So you need to assign the value found at the j index to be at index j + 1. Remmeber that you assign the thing on the right to the thing on the left.

still not getting the point . Seems you just repeating the instruction

here you are assigning array[j + 1] to array[j]. It;s the wrong thing to do.
Try to read again the instructions and understand what you have to do.

Thanks just corrected my mistake when I see spending almost 3 hours on little mistake… :hugs: :grinning: