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

41 votes296 views6 answers
Dataframe in python
Python
0 vote237 views1 answer
Session has key python 3
Python
0 vote290 views1 answer
Redirect if not logged in django
Python Django
5 votes294 views1 answer
Pip3 install pyaml
Python
0 vote299 views1 answer
Myshop flower notimplementederror
Python
0 vote258 views1 answer
Star psf
Python
0 vote236 views1 answer
Not mutable data type in python
Python
6 votes272 views3 answers
Python compiler application in tkinter
Python
85 votes257 views6 answers
How to create virtual environment
Python
0 vote229 views1 answer
How to call column name with space in python
Python