Listes

import random as rand

def liste(n, p):
    returned = []
    for i in range(0, n):
        returned.append(rand.randint(1, p))
    return returned

def insertion(listeATrier):
    print(listeATrier)
    for i in range(0, len(listeATrier)):
        for j in range(0, len(listeATrier)):
            if listeATrier[i] < listeATrier[j]:
                listeATrier.insert(j, listeATrier[i])
                listeATrier.pop(i+1)
                break
    return listeATrier

def selection(listeATrier):
    for i in range(0, len(listeATrier)):
        minimum = listeATrier[i]
        indiceMinimum = -1
        for j in range(i, len(listeATrier)):
            if listeATrier[j] < minimum:
                minimum = listeATrier[j]
                indiceMinimum = j
        listeATrier[i], listeATrier[indiceMinimum] = minimum, listeATrier[i]
    return listeATrier

def bulle(listeATrier):
    echange = True
    while echange == True:
        echange = False
        for i in range(0, len(listeATrier)):
            if i < len(listeATrier) - 1 and listeATrier[i + 1] < listeATrier[i]:
                echange = True
                listeATrier[i + 1], listeATrier[i] = listeATrier[i], listeATrier[i + 1]

    return listeATrier

def tri_rec(l, p, d):
    print(l)
    if (len(l) == 1):
        return l
    elif (len(l) == 0):
        print("merde")
    else:
        part = partition(l, p)
        print("part : " + str(part))
        print("test : " + (tri_rec(part[0], 0, 0).append(part[2])))
        return (tri_rec(part[0], 0, 0).append(part[2])).extend(tri_rec(part[1], 0, 0))


def partition(l, p):
    inf = []
    sup = []
    pivot = l[p]
    for i in range(0, len(l)):
        val = l[i]
        if i == p:
            continue
        if val < pivot:
            inf.append(val)
        else:
            sup.append(val)
            print(sup)

    return [inf, sup, l[p]]

# print(partition(liste(5, 15), 0))

def fusion(l1, l2):
    triee = []
    print(l1)
    for i in range(0, len(l1)):
        for j in range(0, len(l2)):
            if (l1[i] < l2[j]):
                triee.append(l1[i])
                break
            else:
                triee.append(l2[j])
                l2.pop(j)
                break

    return triee

l1 = liste(5, 15)
l1.sort()
l2 = liste(5, 15)
l2.sort()

print(fusion(l1, l2))