Insertion sort python

#Insertion sort
ar = [34, 42, 22, 54, 19, 5]

for i in range(1, len(ar)):
    while ar[i-1] > ar[i] and i > 0:
        ar[i-1], ar[i] = ar[i], ar[i-1]
        i -= 1
print(ar)

Insertion sort in python

def insertion(s):
    for i in range(0,len(s)-1):
        if s[i]>s[i+1]:
            s[i],s[i+1]=s[i+1],s[i]
            for j in range(i,0,-1):
                if s[j]<s[j-1]:
                    s[j],s[j-1]=s[j-1],s[j]
    print(s)
    
insertion([5,2,1,9,0,4,6])

-7

Similar codes

0 vote141 views1 answer
Find out how many rows are missing in the column 'your_column'
Python
1 vote188 views1 answer
Pytho narrondir un nombre
Python
74 votes182 views1 answer
How to update pip in anaconda prompt
Python
1 vote175 views2 answers
One hot encoder python
Python
0 vote222 views1 answer
Connectionrefusederror at /accounts/signup/ django allauth
Python Django
4 votes188 views4 answers
Interface graphique sur python
Python
12 votes188 views6 answers
Print()
Python
0 vote165 views1 answer
Add a string to each element of a list python
Python
1 vote172 views1 answer
How to use with open
Python
-4 votes178 views2 answers
The Dreamers
Python