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 vote182 views1 answer
Open link in tab new trong selenium python
Python
12 votes178 views2 answers
Is python object oriented language
Python
0 vote168 views1 answer
Python indent selection
Python
1 vote199 views4 answers
Pandas count zeros in column
Python
16 votes167 views6 answers
Django model
Python
0 vote180 views1 answer
Light fm cold start problem
Python
0 vote169 views1 answer
How to capture video in google colab with python
Python
5 votes189 views2 answers
Python if defined
Python
3 votes161 views9 answers
Creating environment variable in python
Python
1 vote196 views1 answer
Join function
Python