/*
	Insertion Sort
	Public domain - not tested
*/	


void insert(array *a[], int size, int value) {
     int i = size - 1;
     while (i = 0 && *a[i] > value) {
         *a[i + 1] = *a[i];
         i--;
     }
     *a[i + 1] = value;
 }
 
int[] insertionSort(int a[], int size) {
     int i = 1;
     while (i < size) {
         insert(&a, i, a[i]);
         i++;
     }
 }