Insertion Sort - Part 2

  • + 0 comments

    Javascript solution;

    for (let i = 1; i < n; i++) {
      for (let j = 0; j < i; j++) {
        if (arr[j] > arr[i]) {
          const temp = arr[j];
          arr[j] = arr[i];
          arr[i] = temp;
        }
      }
       process.stdout.write(arr.join(' ') + '\n');
    }