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 vote348 views1 answer
Type of tuple in python
Python
0 vote336 views1 answer
DataFrame changed by function
Python
0 vote333 views1 answer
Compute Jordan normal form of matrix in Python / NumPy
Python
0 vote346 views1 answer
Dictionary default value python if key not found
Python
0 vote350 views1 answer
How to go sown a line in pyton
Python
2 votes452 views4 answers
Min and max in python
Python
0 vote378 views2 answers
Multiclasshead
Python
0 vote346 views1 answer
Pyplot common labels
Python
0 vote370 views1 answer
X not defined python
Python
0 vote334 views1 answer
From matrix to array python
Python