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 vote200 views1 answer
Ord python3
Python
0 vote184 views1 answer
Print and remove previous line
Python
2 votes180 views2 answers
Timestamp e datetime python
Python
6 votes188 views2 answers
Sys.executable
Python
0 vote252 views1 answer
Dataframe pandas filter rows by list of values
Python
1 vote184 views1 answer
Not getting spanish characters python
Python
0 vote243 views1 answer
Django template child data in nested loop
Python Django
0 vote177 views1 answer
How to import the whall library in python
Python
1 vote214 views6 answers
Add item to tuple python
Python
13 votes179 views3 answers
Python package version
Python