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

26 votes170 views2 answers
Import time in python
Python
9 votes165 views2 answers
Any in if python stack overflow
Python
7 votes188 views4 answers
How to use lambda function in python
Python
0 vote163 views1 answer
Dataframe to ftp
Python
6 votes165 views2 answers
Unique list values python ordered
Python
2 votes191 views2 answers
Raise XLRDError(FILE_FORMAT_DESCRIPTIONS[file_format]+'; not supported') xlrd.biffh.XLRDError: Excel xlsx file; not supported
Python
1 vote172 views1 answer
Why do we use graphs?
Python
0 vote183 views1 answer
Change column row box colour tkinter
Python
1 vote174 views2 answers
Python 3d software
Python
1 vote198 views1 answer
Search in google with python
Python