Week 5: Algorithm analysis, searching, sorting
void selectionSort(int list[], int size)
{
   int j, k;
   int pos, max;
   for (k = size-1; k > 0; k--) {
      pos = 0;
      max = list[0];
      for (j = 1; j <= k; j++) {
         if (list[j] > max)
         {
            max = list[j];
            pos = j;
         }
      }
      swap(&list[pos], &list[k]);
   }
}