Insertion Sort https://jsbin.com/sezuqan

Insertion-Sort.js

// Insertion Sort
// Insertion sort is a comparison-based algorithm that builds a final sorted array one element at a time.
// It iterates through an input array and removes one element per iteration, finds the place the element belongs in the array, and then places it there.
// https://brilliant.org/wiki/sorting-algorithms/


var array = [47,59,98,98,91,10,0,9,14,12]

console.log(insertionSort(array))

function insertionSort(array) {
  
  for (var i = 1; i < array.length; i++) {
    
    for (var j = i; j > 0; j--) {
      
      if (array[j] < array[j-1]) {
        
        //swap
        var temp = array[j]
        array[j] = array[j-1]
        array[j-1] = temp
        
      }
      
    }
    
  }
  return array;
}