def tri(l) :
    for n in range(len(l)-2) :
        for i in range(len(l)) :
            if l[i]>l[i+1] :
                l[i],l[i+1] = l[i+1],l[i]




def tri2(l,b=0,e=0):
    if e==0 :
        e = len(l)
    if e-b<2 :
        return
    m =(e+b) //2
    tri2(l,b,m)
    tri2(l,m,e)
    t1 = l[b:m]
    i1 = b
    t2 = l[m:e]
    i2 = m
    for i in range(b,e) :
        if i1 == m :
            l[i:e] = t2[i2-m:]
            break
        elif i2 == e :
            l[i:e] = t1[i1-b:]
            break
        if t2[i2-m]<t1[i1-b] :
            l[i] = t2[i2-m]
            i2+=1
        else :
            l[i] = t1[i1-b]
            i1+=1
        
            
            
        
    
        










a = [12,3,54,3,4,43]

print(a)
tri(a)
print(a)