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 vote230 views1 answer
Bs.newtag() inner html
Python
28 votes165 views7 answers
Anagram python
Python
6 votes255 views2 answers
Lofi hip hop radio online
Python
8 votes226 views1 answer
Positive lookahead regex python
Python
0 vote193 views1 answer
Python crear variables
Python
0 vote206 views1 answer
Flask mongoengine configuration
Python
0 vote224 views1 answer
Python map function using lambda function as one of the parameters
Python
11 votes247 views3 answers
Python pip install pandas
Python
0 vote217 views3 answers
Dataframe row print
Python
5 votes240 views3 answers
One hot encoding
Python