Algoritmi za sortiranje - Insertion sort

#include <iostream>
using namespace std;

int main()
{
    int n;
    cin>>n;

    int A[n];

    for (int i=0;i<n;i++)
        cin>>A[i];

    int vr,j;

    for (int i=1;i<n;i++)
    {
        vr=A[i];
        j=i-1;

        while (j>=0 && A[j]>vr)
        {
            A[j+1]=A[j];
            j--;
        }
        A[j+1]=vr;
    }

    for (int i=0;i<n;i++)
        cout<<A[i]<<' ';
    cout<<endl;

    return 0;
}