[hackerrank] Insertion Sort

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


void print(vector<int> & A)
{
    const int N = A.size();
    for(int i = 0; i < N; ++i)
    {
        cout << A[i] << ' ';
    }
    cout << '\n';
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int N;
    cin >> N;

    int i;
    vector<int> A(N);
    for(i = 0; i < N; ++i)
    {
        cin >> A[i];
    }

    for(i=1; i < N; ++i)
    {
        for(j=i-1; j>=0; --j)
        {
            if
        }
    }

    return 0;
}