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

2 votes131 views1 answer
Django mysql
Python
1 vote131 views1 answer
Calculate pointbiseral correlation
Python
0 vote165 views3 answers
Pyinstaller add files
Python
0 vote129 views1 answer
Discord.py APK
Python
0 vote143 views2 answers
How to split string with comma in python
Python
0 vote147 views1 answer
Python get all items from generator
Python
0 vote97 views2 answers
-88
Python
3 votes132 views3 answers
Python check ram usage
Python
10 votes160 views4 answers
Python webbrowser module
Python
0 vote166 views1 answer
Query first 5 element in django
Python Django