Simple Insertion sort

insertionsort.c

void swap(int *a, int *b) {
  int temp = *a;
  *a = *b;
  *b = temp;
}

int *insertionSort(int *array, int count) {

  for(int i = 1; i < count; i++) { // start at the second element
    int replacer = i;
    while(replacer > 0 && array[replacer] < array[replacer-1]) {
      swap(&array[replacer], &array[replacer-1]);
      replacer--;
    }
  }
}