算法导论笔记至第章节编号

    Funtion Name: INSERTION-SORT
    Input: array of <a1, a2, ..., an>;
    Output: array of <a1’, a2’, …, an’>, a1’<=a2’<=…<=an’;

    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

    #include<iostream>
    using namespace std;
    
    template<typename T>
    void insertionSort(T* a, int length)
    {
    	T key;
    	i