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 vote135 views1 answer
How to have requirement file in python for libs
Python
0 vote146 views1 answer
Flask recive list
Python
0 vote119 views1 answer
HTTP Error 403: Forbidden django account signup email
Python Django
0 vote144 views1 answer
Python detect ranges in list
Python
1 vote149 views2 answers
Django get settings
Python
45 votes154 views4 answers
Append to front of list python
Python
0 vote142 views1 answer
Python print numbers 1 to 10 in one line
Python
3 votes140 views3 answers
Run a shell script from python
Python
0 vote145 views1 answer
Is there a gif package for python
Python
0 vote136 views1 answer
Pug compile exploit
Python