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 vote127 views1 answer
How to add an active class to current element in navbar in django
Python Django
0 vote113 views1 answer
Python apply function to list
Python
0 vote107 views1 answer
Triplets in python
Python
12 votes100 views4 answers
Remove duplicates from tuple python
Python
0 vote106 views2 answers
Pairwise swap in data structure in python
Python
0 vote118 views1 answer
Module 'torch' has no attribute 'square'
Python
0 vote97 views1 answer
Randomly splits this DataFrame with the provided weights
Python
4 votes97 views3 answers
How to make a button in python
Python
1 vote88 views1 answer
Get attribute in selenium python
Python
0 vote96 views1 answer
Compute the 2d histogram of x and y.
Python