Insertion sort

insertionSort.js

function insertionSort(a) {
    for(var i=1;i<a.length;i+=1) {
        if(a[i]<a[i-1]) {
            var tmp = a[i];
            for(var j=i-1;i>=0&&a[j]>tmp;j-=1) {
                a[j+1] = a[j];
            }
            a[j+1] = tmp;
            console.log(a);
        }
    }
    return a;
}