Insertion Sort

insertion-sort.c

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

void insertion_sort(int *source_array, int number_of_elements) {

    int i, j, t;

    for (i = 1; i < number_of_elements; i++) {
        t = source_array[i];

        for (j = i; j > 0 && t < source_array[j - 1]; j--) {
            source_array[j] = source_array[j - 1];
        }

        source_array[j] = t;
    }
}

int main() {
    int source_array[] = {4, 65, 2, -31, 0, 99, 2, 83, 782, 1};
    int number_of_elements = sizeof source_array / sizeof source_array[0];
    int i;

    for (i = 0; i < number_of_elements; i++) {
        printf("%d%s", source_array[i], i == number_of_elements - 1 ? "\n" : " ");
    }

    insertion_sort(source_array, number_of_elements);

    for (i = 0; i < number_of_elements; i++) {
        printf("%d%s", source_array[i], i == number_of_elements - 1 ? "\n" : " ");
    }

    return 0;
}