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 vote121 views1 answer
Making constructor in python
Python
13 votes92 views1 answer
Install python2.7 ubuntu
Python
1 vote121 views1 answer
Generate valid sudoku board python
Python
0 vote127 views2 answers
How to check sklearn version in cmd
Python
42 votes143 views6 answers
Python find directory of file
Python
14 votes141 views1 answer
Play music from python
Python
80 votes124 views4 answers
Save pandas into csv
Python
-1 vote139 views4 answers
Flask docs
Python
0 vote123 views1 answer
Derivative of multivariable function pytorch
Python
-1 vote164 views1 answer
Import http response in django
Python Django