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

3 votes314 views1 answer
Restore index after concatenate
Python
0 vote310 views2 answers
Pyqt close window
Python
0 vote307 views1 answer
StringIndexer pyspark
Python
12 votes331 views6 answers
Python open pickle file
Python
0 vote307 views1 answer
Fibonacci list pyton
Python
0 vote337 views2 answers
Diagonal difference hackerrank solution in python
Python
62 votes342 views6 answers
Python loop with index
Python
1 vote312 views1 answer
Python 3 tkinter treeview example
Python
67 votes323 views6 answers
Deleting duplicates in list python
Python
14 votes314 views1 answer
Play videos in python
Python