#include <stdio.h>
#include <stdlib.h>

void insertion_sort(int arr[])
{
    int i, j, key;

    int size = sizeof(arr);
    for(i = 1; i < size; ++i)
    {
        key = arr[i];
        j = i - 1;
        while (j >= 0 && arr[j] > key)
        {
            arr[j + 1] = arr[j];
            j = j - 1;
        }
        arr[j + 1] = key;
    }
    for(i = 0; i <= size; ++i)
        printf("%d ", arr[i]);
}


int main()
{
    int nums_unsorted[] = {4,1,3,5,2,6,9,7,8};

    insertion_sort(nums_unsorted);

    return EXIT_SUCCESS;
}