Algorithms for Selection Sort and Bubble Sort
from p 401 of textbook, modified
find and return the index of the
smallest value in the array within the
given range
int get_max_range(
char list[ ], /* the array we are
looking in */
int first, /* the index of the
first element we will
look at */
int last ) /* the index of the
last element we will
look at */
index_of_max = first
for each value of i from first+1 to last
if list[i] is greater than
list[index_of_max]
update index_of_max to i
return index_of_max
