Week 5: Algorithm analysis, searching, sorting
/* Find maximum in list[0],…,list[k] */
pos = 0;
max = list[0];
for (j = 1; j <= k; j++) {
   if (list[j] > max)
   {
       max = list[j];
       pos = j;
    }
}
     
Find Maximum