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

7 votes266 views2 answers
Python: remove duplicate in a specific column
Python
0 vote287 views1 answer
Tkinter change button text
Python
5 votes255 views2 answers
Python copy instance
Python
5 votes296 views3 answers
Python convert list to list of strings
Python
3 votes246 views1 answer
Visualize correlation matrix python
Python
0 vote283 views1 answer
Python submit work to redis
Python
1 vote269 views1 answer
Python how to check if a functions been called
Python
7 votes269 views2 answers
Python how to use logarithm
Python
1 vote300 views1 answer
Sklearn accuracy
Python
0 vote257 views1 answer
Run julia in p;ython
Python