# Créé par Xavier, le 25/06/2019 en Python 3.4
tas=[[8,True],
      [2,False],
      [6,False],
      [1,True],
      [12,False],
      [5,False],
      [3,True]]

N=len(tas)


def echanger(i,j):
    aux=tas[i]
    tas[i]=tas[j]
    tas[j]=aux

def idMax(n):
    idM=n
    for i in range(n+1,N):
        if tas[idM][0]<tas[i][0]:
            idM=i
    return idM

def renverser(i0,i1):
    assert(i0<=i1)
    for i in range((i1-i0)//2+1):
    #for i in range((n-i0)//2):
        echanger(i0+i,i1-i)

def crepe(n):
     if n < N:
        idM=idMax(n) # n
        print(tas)
        renverser(idM,N-1) #n
        if tas[N-1][1] == False :
          tas[N-1][1]=True
        print(tas)
        renverser(n,N-1)
        #M.append(tas.copy())
        if n>0 : assert(max(tas[n-1:])==tas[n-1])
        crepe(n+1)


crepe(0)