sorts

insertion.js

function InsertionSort (array, swap, compare) {
    if (compare === null || compare === undefined)
        compare = (a, b) => {
            return a < b }
    
    if (swap === null || swap === undefined) 
        swap = (a, b, c) => {
            const [ x, y ] = [ a[b], a[c] ]
            a[b] = y
            a[c] = x; return a }
            //a[b] = a[b] ^ a[c];
            //a[c] = a[c] ^ a[b];
            //a[b] = a[b] ^ a[c]; return a }
    
    for (let h = 1, length = array.length; h < length; h++)
    for (let k = h - 1; k >= 0; k--)
    if (!compare(array[h], array[k]))
    break;
    else
        array = swap(array, h, k);
    
    return array
}