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 vote280 views1 answer
Only split from third delimiter python
Python
0 vote312 views1 answer
Django how to create superuser if does not exists on migration
Python Django
0 vote291 views1 answer
Index in for loop
Python
10 votes277 views2 answers
Select an element of a list by random
Python
0 vote325 views1 answer
Keylogger to exe
Python
0 vote331 views1 answer
Django customize the user model
Python Django
0 vote273 views1 answer
The Bytearray Type
Python
27 votes282 views2 answers
Python null
Python
0 vote276 views2 answers
Cv2 frame size
Python
0 vote360 views1 answer
Create array of specific size python
Python