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 vote262 views2 answers
How to sum numpy matrix diagonal
Python
0 vote213 views1 answer
Right-left staircase python
Python
0 vote243 views1 answer
Super().__init__(pos, model) in python
Python
0 vote215 views1 answer
Numpy is not nan
Python
0 vote233 views1 answer
Modbusfc03 python
Python
0 vote222 views1 answer
Python -m pip install -u pip
Python
31 votes223 views2 answers
Matplotlib 3.0.3 wheel file
Python
29 votes242 views2 answers
Crispy forms
Python
0 vote227 views1 answer
Python OPERATORS, Data Types: LIST, SET, TUPLE, DICTIONARY
Python
1 vote215 views1 answer
Python __version__
Python

Insertion sort python

Insertion sort python

Insertion sort in python

How to sum numpy matrix diagonal

Right-left staircase python

Super().init(pos, model) in python

Numpy is not nan

Modbusfc03 python

Python -m pip install -u pip

Matplotlib 3.0.3 wheel file

Crispy forms

Python OPERATORS, Data Types: LIST, SET, TUPLE, DICTIONARY

Python version