Insertion - Sort algo

by jpsierens

JavaScript

// insertion sort
function insertionSort(items) {

    var len = items.length,  
    var value, i, j;                          

    for (i=0; i < len; i++) {
        value = items[i];

        for (j=i-1; j > -1 && items[j] > value; j--) {
            items[j+1] = items[j];
        }

        items[j+1] = value;
    }

    return items;
}

console.log(insertionSort([1,2,5,3,7,2]))