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 vote278 views1 answer
SettingWithCopyWarning
Python
0 vote293 views1 answer
Nested ternary operator python
Python
16 votes319 views6 answers
Fillna with mean pandas
Python
0 vote453 views1 answer
Json indent options python
Python
0 vote250 views1 answer
Class has no object members
Python
0 vote283 views1 answer
Image loader RGB transform
Python
16 votes282 views6 answers
Python install pandas
Python
1 vote310 views1 answer
Wait() in python tkinter
Python
1 vote266 views1 answer
Except do nothing python
Python
0 vote264 views3 answers
Captcha.image install in python
Python