Solution Exercise 55: algorithme de tri par insertion en Python

Exercice 55

Ecrire un algorithme en Python permettant de trier une liste selon l'algorithme du tri par insertion.

Solution

# fonction qui tri un tableau selon l'algorithme de tri par insertion
def sort_insertion (tab):
     # Browse from 1 to tab size
     for i in range (1, len (tab)):
          k = tab [i]
          j = i-1
          while j >= 0 and k <tab [j]:
                    tab [j + 1] = tab [j]
                    j  = j - 1
          tab [j + 1] = k
     return tab
# Test de l'algorithme 
tab = [18, 11, 23, 55, 7, 63, 17, 33]
print(sort_insertion (tab))
#The outputLa sortie est: [7, 11, 17, 18, 23, 33, 55, 63]

# fonction qui tri un tableau selon l'algorithme de tri par insertion

def sort_insertion (tab):

# Browse from 1 to tab size

for i in range (1, len (tab)):

k = tab [i]

j = i-1

while j >= 0 and k <tab [j]:

tab [j + 1] = tab [j]

j = j - 1

tab [j + 1] = k

return tab

# Test de l'algorithme

tab = [18, 11, 23, 55, 7, 63, 17, 33]

print(sort_insertion (tab))

#The outputLa sortie est: [7, 11, 17, 18, 23, 33, 55, 63]

Younes Derfoufi
CRMEF OUJDA

Post Views: 3 828

Solution Exercise 55: algorithme de tri par insertion en Python

Exercice 55

Solution

1 thought on “Solution Exercise 55: algorithme de tri par insertion en Python”

Leave a Reply Cancel reply