insertion sort

insertion sort

• JS实现

let A = [3,4,5,1,6,12,8,9,7]
let i, x, j
for (i = 1; i< A.length; i++)
{
    x = A[i];
    for (j = i - 1; j >= 0; j--)
    {
        if (A[j] > x) {A[j+1] = A[j]}
        else {
            A[j+1] = x;
            break;
        }
    }
    if (j < 0) {A[0] = x;}
}
console.log(A)