算法导论(第三版) 第一部分 基础知识

1. 插入排序

INSERTION-SORT(A) 插入排序(升序)

for j = 2 to A.length
    key = A[j]
    //Insert A[j] into the sorted sequence A[1...j-1]
    i = j - 1
    while i > 0 and A[i] > key
        A[i+1] = A[i]
        i = i -1
    A[i+1] = key