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

0 vote148 views1 answer
Youtube-dl python download to specific folder
Python
81 votes102 views4 answers
Python wait for x seconds
Python
0 vote117 views1 answer
Best fit line python log log scale
Python
0 vote100 views1 answer
Statement used to open a file in python
Python
0 vote100 views1 answer
Generate dates between two dates python
Python
-1 vote86 views1 answer
Len
Python
1 vote123 views1 answer
Prevent list index out of range python
Python
0 vote124 views1 answer
Access host database django docker
Python Django
2 votes100 views2 answers
Fibonacci sequence python 2.7
Python
0 vote100 views1 answer
Python convert exponential to int
Python