Insertion Sort

by Trever Shick

HTML

<script src="https://rawgit.com/trevershick/6d9364085a1e566b2e18/raw/console.js"></script>

JavaScript

var unsorted = [0,3,7,4,3,2,5,5,2,1];

function sort(unsorted) {
	if (unsorted.length <= 1) {
	  return unsorted;
  }
  for (var i=1; i < unsorted.length; i++) {
  	var barrier = unsorted[i];
    var j = i-1;
    while (j>=0 && unsorted[j]>barrier) {
    	unsorted[j+1] = unsorted[j];
      j--;
    }
    unsorted[j+1] = barrier;
  }
  return unsorted;
}

console.log(sort(unsorted));
console.log(sort([3]));