#insertion sort
def insert(a):
    for i in range(1, len(a)):
        ele=a[i]
        j=i-1
        while j>=0 and ele<a[j]:
            a[j+1]=a[j]
            j-=1
        a[j+1]=ele
a=[12, 13, 11, 5, 8]
insert(a)
a
        

8d8fc1b718cb8be9fdd8a883669dc94d54aba967
<mask token>

def insert(a):
    for i in range(1, len(a)):
        ele = a[i]
        j = i - 1
        while j >= 0 and ele < a[j]:
            a[j + 1] = a[j]
            j -= 1
        a[j + 1] = ele


<mask token>

def insert(a):
    for i in range(1, len(a)):
        ele = a[i]
        j = i - 1
        while j >= 0 and ele < a[j]:
            a[j + 1] = a[j]
            j -= 1
        a[j + 1] = ele


<mask token>
insert(a)
a

def insert(a):
    for i in range(1, len(a)):
        ele = a[i]
        j = i - 1
        while j >= 0 and ele < a[j]:
            a[j + 1] = a[j]
            j -= 1
        a[j + 1] = ele


a = [12, 13, 11, 5, 8]
insert(a)
a

#insertion sort
def insert(a):
    for i in range(1, len(a)):
        ele=a[i]
        j=i-1
        while j>=0 and ele<a[j]:
            a[j+1]=a[j]
            j-=1
        a[j+1]=ele
a=[12, 13, 11, 5, 8]
insert(a)
a
        
