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

13 votes192 views1 answer
What is a slug
Python
0 vote229 views1 answer
Boto3 with aws profile
Python
0 vote196 views1 answer
Create table numpy
Python
3 votes206 views2 answers
Randomly shuffle array python
Python
0 vote199 views1 answer
Python: dunder init method
Python
3 votes172 views2 answers
Python functional foreach
Python
0 vote207 views1 answer
How to make a relationship in python
Python
1 vote205 views2 answers
Location of python in cmd
Python
1 vote193 views1 answer
Python nameerror input
Python
30 votes200 views6 answers
Django static files
Python