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

13 votes111 views2 answers
How to convert python input to int
Python
0 vote129 views1 answer
Sum of values with none
Python
52 votes147 views6 answers
Sorting a dictionary in python
Python
0 vote110 views1 answer
Python - subset dataframe based on unique value of a clumn
Python
34 votes122 views6 answers
Round python
Python
9 votes117 views1 answer
Print current dirfile dir python
Python
1 vote115 views2 answers
Divide a value by all values in a list
Python
1 vote112 views1 answer
Why is python so popular
Python
2 votes106 views2 answers
Or operator django
Python
0 vote100 views1 answer
Colorbar min max matplotlib
Python