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 vote195 views1 answer
Loop through words in a string python
Python
0 vote252 views1 answer
Mac big sur and python3 problems
Python
0 vote232 views1 answer
Python reading into a text file and diplaying items in a user friendly manner
Python
0 vote227 views1 answer
Wx.SingleInstanceCheckerindexmodules
Python
0 vote248 views1 answer
How to make ui dialog pop in front pyqt
Python
22 votes218 views6 answers
Sort key python
Python
1 vote260 views1 answer
Discord.py commands.group
Python
0 vote240 views1 answer
Sphinx, where to write the glossary of a sofware project
Python
0 vote236 views1 answer
Python generate public private key pair
Python
1 vote231 views1 answer
Pywhatkit
Python