Insertion Sort C Code with an Array

insertionSort.c

#include <stdio.h>
#define SIZE 10000

int myArray[SIZE - 1];

void insertionSort(int x[])
{
    int i, j;
    int key;

    for(i = 1; i < SIZE; i++)
    {
        key = myArray[i];
        j = i - 1;
        while(j >= 0 && myArray[j] > key)
        {
            myArray[j+1] = myArray[j];
            j--;
        }
        myArray[j+1] = key;
    }
}

void printSorted()
{
    int i;
    for( i = 0; i < SIZE - 1; i++)
    {
        printf("%d\n", myArray[i]);
    }
}

void swapf(int x, int y)
{
    int temp;
    temp = myArray[x];
    myArray[x] = myArray[y];
    myArray[y] = temp;

}

void init()
{
    int i;
    for( i = 0; i < SIZE - 1; i++)
    {
        myArray[i] = rand()%10000;
    }
}

int main()
{
    init();
    insertionSort(myArray);
    printSorted();
    return 0;
}