Implementação do Insertion Sort

insertionSort.c

#include <stdio.h>

void insertS(int *V, int N){
    
    int z,i,j,aux;
    
    for(i=1;i<N;i++){
        aux= V[i];
        
         for(j=i;(j>0) && (aux<V[j-1]);j--)
         V[j] = V[j-1];
        V[j]=aux;
        
        for(z=0;z<N;z++){
        
        printf("%d ",V[z]);
        
    }
    printf("\n");
        
    }

}
    

int main()
{
    int V[] = {23,4,67,-8,90,54,21};
    
    insertS(V,7);

    return 0;
}