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 vote129 views1 answer
Python check mognodb size
Python
0 vote139 views1 answer
How to read a pkl file in python
Python
8 votes127 views3 answers
Load model keras
Python
0 vote149 views1 answer
Statement used to open a file in python
Python
0 vote171 views1 answer
Python map function using lambda function as one of the parameters
Python
0 vote112 views1 answer
Read api from django
Python
0 vote125 views3 answers
Django prevent duplicate entries
Python
3 votes125 views3 answers
Python extract every nth value from list
Python
1 vote130 views1 answer
How to make multiple place holders in a string with %s python
Python
0 vote114 views2 answers
Callbacks to function pysimplegui
Python