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 vote163 views1 answer
Python type hint superclass
Python
3 votes163 views2 answers
How to find the path of a python module
Python
14 votes183 views6 answers
Python print variable
Python
11 votes164 views1 answer
Python windows os.listdir path usage
Python
1 vote166 views1 answer
Not getting spanish characters python
Python
0 vote191 views1 answer
File.open("file.txt);
Python
0 vote195 views1 answer
Python on_mouse_down/collidepoint
Python
0 vote170 views1 answer
Enumerate in range python
Python
115 votes201 views6 answers
Write json to file python
Python
3 votes158 views1 answer
Python procedured
Python