# ENCM 335 Fall 2019 Lab 8 Exercise C Part 2


# Writing code to sort a list is a good for learning Python syntax,
# but if you need to sort a list in a bigger project, please DON'T
# write your own sort function!
#
# If x is a list, this statement will sort it ...
#
# x.sort()
#
# And if y is a list, this statement makes z a sorted copy of y
# and leaves y unchanged ...
#
# z = sorted(y)

def insertion_sort(x):
    """Sort list from smallest to largest with insertion sort."""

    i = 0
    k = 1

    while k < len(x):
        old_val = x[k]
        i = k
        while i !=0 and x[i-1] > old_val:
            x[i] = x[i-1]
            i -= 1
        x[i] = old_val
        k += 1

def do_a_test(a):
    print('before sorting:', a)
    insertion_sort(a)
    print('after sorting: ', a)
    print()

do_a_test([10, 9, 7, 11, 8, 6, 12])
do_a_test([2.5, -0.5, 1.25, 0.25, -1.5])
do_a_test(['BC', 'AB', 'SK', 'MN', 'ON', 'QC', 'NB', 'PE', 'NS', 'NL'])