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 vote503 views1 answer
Python doctype
Python
0 vote117 views1 answer
Non preemptive priority scheduling in c#
Python
9 votes115 views2 answers
Basic tkinter gui
Python
0 vote111 views1 answer
How to save the command result with ! in python
Python
0 vote114 views1 answer
Get element from string with deliminator python
Python
1 vote102 views1 answer
Def __init__ python not overwrite parrent class
Python
38 votes104 views2 answers
How to get the contents of a txt file in python
Python
0 vote102 views3 answers
Float
Python
1 vote111 views1 answer
What does [::-1] mean in python
Python
14 votes133 views6 answers
Binary search python
Python