Insertion Sort - Part 2

  • + 1 comment

    Hey, converted your answer to JS, but it will only pass first 2 test, thought?

    for (var i = 1; i < array.length; i++) {
      var j = i;
      var value = array[i];
      while (j >= 1 && (array[j-1] > value)) {
        array[j] = array[j-1];
        j--;
      }
      array[j] = value;
      console.log(array.join(' '));
    }