#include <stdio.h>

int main()
{
    int i;
    double x[] = { 6, 7 , 3, 9, 2, 5, 0, 1, 3, 8 };
    printf("\nBefore sorting:\n\n");
    for (i = 0; i < 10; i++) printf("%f\n", x[i]);
    printf("\nAfter sorting:\n\n");
    insertion_sort(x, 10);
    for (i = 0; i < 10; i++) printf("%f\n", x[i]);
}

insertion_sort(double *A, int n)
{
    int i, j;
    double key;
    for (j = 1; j < n; j++) {
	key = A[j];
	i = j-1;
	while (i > -1 && A[i] > key) {
	    A[i+1] = A[i];
	    i = i-1;
	}
	A[i+1] = key;
    }
}