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

1 vote135 views1 answer
Python match statement
Python
0 vote134 views1 answer
Weather api python
Python
0 vote129 views1 answer
Conditional relationship sqlalchemy
Python
1 vote88 views2 answers
Python if boolean
Python
1 vote120 views1 answer
Hotel room allocation tool in python
Python
0 vote170 views1 answer
Python - Comment supprimer Commas de la corde
Python
1 vote132 views1 answer
Formula for compounding interest in python
Python
0 vote132 views1 answer
How to convert response to beautifulsoup object
Python
0 vote123 views1 answer
How to kick and ban members with discord.py
Python
1 vote136 views2 answers
Load data python
Python