Insertion sort in python

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 vote188 views1 answer
Django retrieveupdatedestroyapiview
Python Django
0 vote148 views1 answer
Gui def python
Python
46 votes137 views6 answers
Comment in python
Python
6 votes138 views2 answers
Imshow grayscale
Python
0 vote140 views1 answer
Matplotlib orange line
Python
17 votes146 views4 answers
Python delete directory contents
Python
1 vote101 views1 answer
Mongoengine
Python
0 vote148 views1 answer
Two legend left and right x asix matplotlib
Python
0 vote143 views1 answer
Selenium get h1 text python
Python
2 votes138 views6 answers
K
Python