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 vote103 views1 answer
Python information
Python
0 vote118 views1 answer
Display Surface quit
Python
0 vote117 views1 answer
Removing stop words in python
Python
-1 vote113 views1 answer
Pseudocode examples for beginners
Python
1 vote111 views3 answers
Python filter dictionary
Python
3 votes66 views1 answer
Pandas date missing from datetime
Python
0 vote106 views1 answer
Django Signup form
Python
0 vote119 views1 answer
Qiskit setup
Python
2 votes97 views1 answer
Hardest python questions
Python
183 votes126 views6 answers
How to update pip python
Python