Insertion sort in python

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 vote202 views1 answer
52277-36880
Python
-1 vote210 views3 answers
How to get the code of a website in python
Python
0 vote186 views1 answer
Class Student(): def name(self):
Python
0 vote210 views1 answer
Pyqt graph
Python
0 vote191 views1 answer
Python hide print output
Python
5 votes188 views1 answer
Python glob
Python
2 votes155 views1 answer
Jupyter lab
Python
0 vote188 views1 answer
Python program for simple interest
Python
10 votes186 views4 answers
Load model tensorflow
Python
0 vote257 views1 answer
Requests-html absolute url
Python