Académique Documents
Professionnel Documents
Culture Documents
Bubble_sort(A)
For i = n to 1,-1
tableau_trié := vrai
for j = 1 to i-1
if A[j+1] < A[j]
échanger(A[j+1], A[j])
tableau_trié := faux
if tableau_trié
return A
def insertion_sort(A):
for j in range(1,len(A)):
key = A[j]
i = j -1
while i >= 0 and A[i] > key:
A[i+1] = A[i]
i=i-1
A[i+1]=key
return A
liste =[10,9,8,7,6,5,4,3,2,7,6,1,0]
print(insertion_sort(liste))