Hackerrank Correctness and the Loop Invariant Solution

The Solution for hackerrank problem, Correctness and the Loop Invariant using C Program.
Passed Test cases: 3 out of 3

SOURCE CODE:

 #include <stdio.h>  
 #include <string.h>  
 #include <math.h>  
 #include <stdlib.h>  
 #include <assert.h>  
 #include <stddef.h>  
 void insertionSort(int ar_size, int * ar) {    
   int i,j;  
   int value;  
   for(i=1;i<ar_size;i++)  
   {  
     value=ar[i];  
     j=i-1;  
     while(j>=0 && value<ar[j])  
     {  
       ar[j+1]=ar[j];  
       j=j-1;  
     }  
     ar[j+1]=value;      
   }  
   for(j=0;j<ar_size;j++)  
     {  
       printf("%d",ar[j]);  
       printf(" ");  
     }  
 }  
 int main(void) {    
   int _ar_size;  
 scanf("%d", &_ar_size);  
 int _ar[_ar_size], _ar_i;  
 for(_ar_i = 0; _ar_i < _ar_size; _ar_i++) {   
   scanf("%d", &_ar[_ar_i]);   
 }  
 insertionSort(_ar_size, _ar);  
   return 0;  
 }