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 vote189 views1 answer
Log transform pandas dataframe
Python
1 vote213 views1 answer
Django manger
Python
25 votes195 views6 answers
Python remove spaces
Python
0 vote200 views1 answer
Python json nan
Python
1 vote261 views1 answer
Curso python
Python
-1 vote240 views3 answers
Casefold in python
Python
0 vote173 views1 answer
Python flask how to remove last character from string
Python
1 vote260 views1 answer
Matplotlib log2 xaxis
Python
2 votes174 views3 answers
Why is Python called Python
Python
0 vote193 views1 answer
Sring to name variable pyton
Python