Insertion Sort - Part 2 : HackerRank Problem Solution

Insertion Sort - Part 2 : HackerRank Problem Solution

C++ Implementation:

#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cassert>
#include <iostream>
using namespace std;
void insertionSort(int ar_size, int *  ar) {
    int i,value,j,hole;
    for(i=1;i<ar_size;i++)
        {
        value=ar[i];
        hole=i;
        while(hole>0 && ar[hole-1]>value)
            {
            ar[hole]=ar[hole-1];
            hole=hole-1;
            //for(j=0;j<ar_size;j++)
                //printf("%d ",ar[j]);
            //printf("\n");
        }
        ar[hole]=value;
        for(j=0;j<ar_size;j++)
            printf("%d ",ar[j]);
        printf("\n");
    }
}
int main(void) {
   
    int _ar_size;
    cin >> _ar_size;
    //scanf("%d", &_ar_size);
    int _ar[_ar_size], _ar_i;
    for(_ar_i = 0; _ar_i < _ar_size; _ar_i++) { 
        cin >> _ar[_ar_i];
        //scanf("%d", &_ar[_ar_i]); 
    }
    
   insertionSort(_ar_size, _ar);
   
   return 0;
}