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 vote110 views2 answers
Can data scientists become software developer
Python
0 vote111 views1 answer
Salir programa python
Python
0 vote115 views1 answer
Only size-1 arrays can be converted to python scalars
Python
2 votes112 views2 answers
Python how to get script directory
Python
1 vote154 views1 answer
Django proper capitalization case jinja
Python Django
0 vote120 views1 answer
Create dataframe from two variables
Python
3 votes110 views2 answers
Extract pdf text with python
Python
0 vote119 views1 answer
Pandas invert a boolean Series
Python
3 votes120 views2 answers
Python list comma separated string
Python
1 vote119 views1 answer
Python async map
Python