"""
Tris de complexité quadratiques
"""

def tri_insertion(L):
    for i in range(1,len(L)):
        x = L[i]
        j = i
        while (j > 0) and (L[j-1] > x):
            L[j] = L[j-1]
            j -= 1
        
        L[j] = x
        
    return L

def tri_selection(L):
    for i in range(len(L)-1):
        m = 1
        for j in range(i+1,len(L)):
            if L[j] < L[m]: m = j
        
        if m != i:
            x = L[m]
            L[m] = L[i]
            L[i] = x
            
    return L

"""
Tri fusion de complexité en O(n log n)
"""

def merge_sort(arr):
    if len(arr) <= 1:
        return arr

    mid = len(arr) // 2
    left_half = arr[:mid]
    right_half = arr[mid:]

    left_half = merge_sort(left_half)
    right_half = merge_sort(right_half)

    return merge(left_half, right_half)

def merge(left, right):
    result = []
    i = j = 0

    while i < len(left) and j < len(right):
        if left[i] < right[j]:
            result.append(left[i])
            i += 1
        else:
            result.append(right[j])
            j += 1

    result.extend(left[i:])
    result.extend(right[j:])
    return result

# Exemple d'utilisation :
liste_non_triee = [38, 27, 43, 3, 9, 82, 10]
liste_triee = merge_sort(liste_non_triee)
print(liste_triee)