===========
 PROBLEM 1
===========

Create a program named sorting.py and copy/paste the selection_sort function from our class notes page.

Remove any print statement from it.

Edit the function to instead find the minimum value each phase (pass) and at the end of the pass swap the minimum with the "first" place.

Note: for the first pass, the first place is index 0
for the second pass, the new "first" place is at index 1
and so on

===========
 PROBLEM 2
===========

*****OPTIONAL b/c it is CHALLENGING

Visit:  https://math.hws.edu/eck/js/sorting/xSortLab.html

And observe how insertion sort works.

Attempt an implementation of insertion sort in a program named insertion.py .

e.g.

mylis = [6,5,4,8,2]
insertion_sort(mylis)

# mylis should now be sorted and become: [2,4,5,6,8]

Your function should work on any size list

================
 What to submit 
================

sorting.py
insertion.py