Simple Selection sort

gistfile1.c

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

  // at is location of first unordered item, minimum is unordered list minimum
  int at = 0, minimum = 0;

  for(at = 0; at < count-1; at++) {
    minimum = at; // set minimum to the current replacer

    for(int i = at+1; i < count; i++) { // find minimum
      if(array[i] < array[minimum]) {
        minimum = i;
      }
    }

    // swap
    int temp = array[at];
    array[at] = array[minimum];
    array[minimum] = temp;
  }
}