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 vote263 views1 answer
Open url from ipywidgets
Python
0 vote250 views1 answer
Visitor IP address django
Python
0 vote309 views1 answer
Linking bootstrap in flask
Python Flask
0 vote268 views1 answer
Python can you put try except in list comprehension
Python
59 votes257 views6 answers
Classes in python
Python
0 vote267 views1 answer
Write a python program to find table of a number using while loop
Python
12 votes266 views6 answers
Set python 3 as default mac
Python
0 vote277 views1 answer
How to remove misspelled words in nltk
Python
3 votes276 views4 answers
Convert from python to javascript online
Python
0 vote245 views1 answer
Http404 django
Python