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 votes185 views1 answer
Python custom errors
Python
0 vote216 views1 answer
Python hand tracking module
Python
0 vote200 views1 answer
Cv2 gaussian blur
Python
1 vote184 views1 answer
Python nameerror input
Python
4 votes189 views1 answer
How to save a neural network pytorch
Python
0 vote191 views2 answers
Instagram comment spammer python
Python
0 vote194 views1 answer
Keras transfer learning
Python
25 votes191 views3 answers
Python find number of occurrences in list
Python
4 votes186 views2 answers
Authentication views django
Python
1 vote199 views1 answer
How to reference a file in python
Python