def bubblesort(my_lst):
    for i in range(len(my_lst)):
        bubble(my_lst, i)
        
def bubble(my_lst, i):
    for j in range(len(my_lst)-i-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

def selectionsort(my_lst):
    for i in range(len(my_lst)):
        select(my_lst, i)
        
def select(my_lst, i):
    max_ind = 0
    for j in range(len(my_lst)-i-1):
        if my_lst[j]>my_lst[max_ind]:
            max_ind = j
    tmp = my_lst[max_ind]
    my_lst[max_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