Selection Sort C Code. I think it is clean and understandable...

selectionSort.c

#include <stdio.h>
#define SIZE 10000

int myArray[SIZE - 1];

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

    for( i = 0; i < SIZE; i++)
    {
        key = i;

        for(j = i + 1; j < SIZE; j++)
        {
            if(myArray[key] > myArray[j])
            {
                key = j;
            }

        }
        swapf(i, 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();
    selectionSort(myArray);
    printSorted();
    return 0;
}