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 vote305 views1 answer
Import combination
Python
0 vote337 views2 answers
Python3 conditional with boolean
Python
0 vote337 views1 answer
Increase recursion depth google colab
Python
1 vote317 views1 answer
Python add item multidimensional list
Python
1 vote323 views1 answer
The python libraries to master for machine learning
Python
3 votes331 views1 answer
Pandas reciprocal
Python
0 vote316 views1 answer
Seaborn barplot remove error bars
Python
0 vote331 views1 answer
Connect to vvenv python
Python
1 vote325 views1 answer
How to count stopwords in df
Python
2 votes308 views2 answers
Python how to get script directory
Python