sorting.c

#include <stdio.h>

void print(int array[], int length) {
    int i;
    printf("{ %d", array[0]);
    for (i = 1; i < length; i++)
        printf(", %d", array[i]);
    printf(" }\n");
}

void selectionsort(int array[], int length) {
    int i, j, min, first;
    for (i = 0; i < length -1; i++) {

        // find the index of the minimum
        min = i;
        for (j = i +1; j < length; j++)
            if (array[j] < array[min]) min = j;

        // put the minimum on top
        first = array[i];
        array[i] = array[min];
        array[min] = first;
    }
}

void insertionsort(int array[], int length) {
    int i, j, curr;
    for (i = 0; i < length; i++) {
        curr = array[i];
        for (j = i-1; j >= 0 && array[j] > curr; j--)
            array[j+1] = array[j];
        array[j+1] = curr;
    }
}

main() {
    int a[] = {5, 7, 86, 2, -7, 6, 6};
    printf("selection sort:\n");
    print(a, 7);
    selectionsort(a, 7);
    print(a, 7);

    int b[] = {98, -72, 45, 3, 5, -1};
    printf("insertion sort:\n");
    print(b, 6);
    insertionsort(b, 6);
    print(b, 6);
}