Algorithme Tri / Tony BEGO

liste = [13,21,4,9,11,1,25,15,3,18]

def tri_insertion(l):
    if len(l) <= 1:
        return l
    for i in range(2, len(l)):
        l = inserer(l, l[i], i)
        print(l)
    return l

def inserer(l, element, i):
    while i > 0 and l[i-1]>element:
        l[i] = l[i-1]
        i -=1
    l[i] = element
    return l

tri_insertion(liste)