def selectionsort(my_lst):
    for i in range(len(my_lst)):
        select(my_lst, i)
        
def select(my_lst, i):
    min_ind = 0
    for j in range(len(my_lst)-i-1):
        if my_lst[j]<my_lst[min_ind]:
            min_ind = j
    tmp = my_lst[min_ind]
    my_lst[min_ind]=my_lst[len(my_lst)-i-1]
    my_lst[len(my_lst)-i-1]=tmp


def insertionsort(my_lst):
    for i in range(1,len(my_lst)):
        insert(my_lst, i)
        
def insert(my_lst, i):
    for j in range(i-1, -1, -1):
        if my_lst[j] < my_lst[j+1]:
            tmp = my_lst[j]
            my_lst[j]=my_lst[j+1]
            my_lst[j+1]=tmp
        else:
            return



def bubblesort(my_lst):
    i = 0
    while (not bubble(L,i)):
        i+=1


def bubble(L, i):
    list_sorted = True
    for j in range(len(L) - 1, i-1):
        if L[j] > L[j+1]:
            tmp = L[j]
            L[j] = L[j+1]
            L[j+1] = tmp
            list_sorted = False
    return list_sorted