def insertion_sort(seq):
    for i in range(1, len(l)):
        for j in range(i, 0, -1):
            if l[j - 1] < l[j]:
                break
            l[j - 1], l[j] = l[j], l[j - 1]

    return l
def insertion_sort(l):
    for i in range(1, len(l)):
        for j in range(i, 0, -1):
            if l[j - 1] < l[j]:
                break
            l[j - 1], l[j] = l[j], l[j - 1]

    return l
Revert "Added implementation of selection sort"
Revert "Added implementation of selection sort"

This reverts commit acf509f392d536c61c0dbed3a07ed24849b00928.
