Insertion sort

by Artem

JavaScript

'use strict';

const a = [5, 3, 1, 2, 6, 4];

function sort(arr) {
  let sorted = [];

  for (let i = 0; i < arr.length; i++) {
    for (let j = i; j > 0; j--) {
      if (arr[j] < arr[j - 1]) {
        let tmp = arr[j - 1];
        arr[j - 1] = arr[j];
        arr[j] = tmp;
      }
    }
  }

	return arr;
}


console.log(sort(a));