insertionSort

#include  <stdio.h>

void insertionSort(int,int *);
int main(void)
{
    int largo,i;
    scanf("%d",&largo);
    int vector[largo];
    for(i=0;i<largo;i++)
    {
        scanf("%d",&vector[i]);
    }

    insertionSort(largo,vector);

    for(i=0;i<largo;i++)
    {
        printf("%d",vector[i]);
    }

    return 0;
}

void insertionSort(int largo,int *vector)
{
    int i,j;
    int aux;

    for(i=1;i<largo;i++)
    {
        j=i-1;
        aux=vector[i];
        while((j>=0) && (vector[j]>aux))
        {
            vector[j+1]=vector[j];
            j--;
        }
        vector[j+1]=aux;
    }
}