List order Algo

move = 0
def start(lst):
    global move
    for j in range (0,len(lst)-1):
        if int(lst[j]) > int(lst[j+1]):
            print('\t- Checking ' + str(lst[j]) +  ' / ' + str(lst[j+1]))
            print('\t=> Moving ' + str(lst[j]) + ' to the end')
            lst.insert(len(lst)-1,lst.pop(j))
            move += 1
            print('++ Intermediate my_list = ' + str(lst))
            start(lst)
    return move

def min_moves(my_list):
    print('+ Original my_list = ' + str(my_list) + '\n')
    x = start(my_list)
    print('\n\t=> Number of moves = ' + str(x) + '\n')
    print('\n+ Final my_list = ' + str(my_list) + '\n')

min_moves([1, 3, 2, 4, 5])