insertionSort in javascript

[chenqing]

const insertionSort = numbers => {
  const len = numbers.length;
  for (let j = 1; j < len; j++) {
    const key = numbers[j];
    let i = j - 1;
    while (i >= 0 && key < numbers[i]) {
      numbers[i + 1] = numbers[i];
      i--;
    }
    numbers[i + 1] = key;
  }
  return numbers;
};

console.log(insertionSort([4, 5, 3, 7, 1, -1, 20, 6]));