Insertion Sort.js

function insertionSort(input){
	var j;
	var temp;
	for(var i = 1; i < input.length; i++){
		j = i;
		while(j > 0 && input[j-1] > input[j]){
			temp = input[j];
			input[j] = input[j-1];
			input[j-1] = temp;
			j--;
		}
	}
}

var test = [1 , 5, 8 ,10, 45, 100, -5];
insertionSort(test);
console.warn(test);