Plotze - Insertion Sort

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define MAX 10000

int main()
{
    int i, a[MAX];

    for (i = 0; i < MAX; i++)
        a[i] = rand() % MAX;

    for (i = 1; i < MAX; i++)
        printf("%i ", a[i]);

    printf("\n", a[i]);

    clock_t start = clock();
    clock_t end;

    insertion_sort(a, MAX);

    end = clock();
    printf("%f", (double)(end - start));

    return 0;
}

void insertion_sort(int a[], int size)
{
    int i, j, x;

    for (i = 1; i < size; i++)
    {
        x = a[i];
        a[0] = x;
        j = i;

        while (x < a[j-1])
        {
            a[j] = a[j-1];
            j--;
        }
        a[j] = x;
    }

    for (i = 1; i < size; i++)
        printf("%i ", a[i]);

    printf("\n");
}

void insertion_sort2(int a[], int size)
{
    int i, j, x;

    for (i = 1; i < size; i++)
    {
        x = a[i];
        a[0] = x;
        j = i;

        while (x > a[j-1])
        {
            a[j] = a[j-1];
            j--;
        }
        a[j] = x;
    }

    for (i = 1; i < size; i++)
        printf("%i ", a[i]);

    printf("\n");
}