Sorting Algorithms

sorting.py

def selection_sort(lst):
    for i in range(len(lst) - 1):
        min_index = i

        for j in range(i + 1, len(lst)):
            if lst[j] < lst[min_index]:
                min_index = j

        lst[i], lst[min_index] = lst[min_index], lst[i]


def insertion_sort(lst):
    for i in range(1, len(lst)):
        current = lst[i]
        j = i
        while j > 0 and lst[j - 1] > current:
            lst[j] = lst[j - 1]
            j -= 1
        lst[j] = current