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

-1 vote214 views1 answer
What is text wrap in python
Python
1 vote266 views2 answers
Python3 to python
Python
0 vote251 views1 answer
Extract name organization using nltk
Python
0 vote206 views1 answer
Proper function pandas
Python
0 vote231 views1 answer
Dataframe select row by index value
Python
7 votes239 views3 answers
Numpy array equal
Python
0 vote237 views1 answer
Python numpy array change axis
Python
2 votes228 views1 answer
Add trendline to plot matplotlib
Python
0 vote208 views1 answer
Python grammar checker api
Python
1 vote222 views1 answer
Jupyter no output cell
Python