#include <iostream>

using namespace std;

/** \ Insert Sort

 *

 *  Key:

 *  * reserve: tm = a[i]

 *  * position: int j = i-1

 *  * move : while

 *

 */

template <typename T>

void insertSort(T a[], int n) {

    T tm;

    for (int i = ; i < n; i++) {

        tm = a[i];

        int j = i-;

        while (a[j] > tm && j >= ){

            a[j+] = a[j];

            j--;

        }

        a[j+]=tm;

    }

}