The For i loop used by the insertionsort algorithm runs from
0 to the arrays last index. What happens if it starts at 1 instead of 0? Does
that change the algorithms run time?
What change to selectionsort could you make that corresponds
to the change described in Exercise 2? Would it change the algorithms run
Write a program that implements selectionsort.