Insertion sort in python

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

1 vote179 views1 answer
Jupyter consumes 100 disk
Python
0 vote179 views1 answer
Plt.imread python
Python
0 vote176 views2 answers
Selenium screenshot python user agent
Python
-1 vote186 views2 answers
From html to jupyter notebook
Python
2 votes191 views1 answer
Python list of all tkinter events
Python
85 votes181 views6 answers
How to create virtual environment
Python
0 vote224 views1 answer
Django save object in view
Python Django
0 vote192 views1 answer
Get element from string with deliminator python
Python
0 vote170 views1 answer
Https://stackoverflow.com/questions/7066121/how-to-set-a-single-main-title-above-all-the-subplots-with-pyplot
Python
0 vote161 views1 answer
Time.ctime(os.path.getmtime phyton in datetime
Python