Week 5: Algorithm analysis, searching, sorting
void insertionSort(int list[], int size)
{
   int j, k;
   int current;
   }
}
for (k = 1; k < size; k++)
   {
      current = list[k];
      j = k;
      while (j > 0 && current < list[j-1]) {
         list[j] = list[j-1];
         j--;
      }
      list[j] = current;