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 vote351 views1 answer
Pandas count show one column
Python
1 vote327 views3 answers
How to find unique values in list in python
Python
0 vote408 views2 answers
Unreadable Notebook: jpyter
Python
8 votes384 views6 answers
Python fibonacci sequence
Python
-2 votes309 views6 answers
Django download
Python
0 vote307 views1 answer
Mutiple codition datafrarme
Python
37 votes332 views6 answers
If list element contains string python
Python
1 vote347 views1 answer
Remove minimize and maximize and cancle button python pyqt5
Python
0 vote313 views1 answer
Python program to read a random line from a file.
Python
0 vote306 views1 answer
Python ip location lookup
Python