Insertion Sort - Part 2

  • + 0 comments

    Simple JavaScript solution

    arr.reduce((p,c,i) => {
        if (i === 0) return p;
        if (c < p.curr[i - 1]) {
          p.curr.splice(i, 1);
          p.curr.splice(p.curr.findIndex((e) => e > c), 0, c);
        }
        p.answer.push(p.curr.join(' '));
        return p;
      }, {curr: [...arr], answer: []}).answer.join('\n');