In [26]:

    

def insertion_sort(seq):
    for n in range(1, len(seq)):
        item = seq[n]
        hole = n
        
        while hole > 0 and seq[hole - 1] > item:
            seq[hole] = seq[hole -1]
            hole = hole - 1
        seq[hole] = item
    
    return seq


    

In [27]:

    

list(range(10,1,-1))


    

    
Out[27]:





[10, 9, 8, 7, 6, 5, 4, 3, 2]

In [28]:

    

print(insertion_sort([3,2,1]))


    

    




[1, 2, 3]

In [29]:

    

def test1(seq):
    for j in range(1-1, -1, -1):
        print(seq[j])


    

In [30]:

    

test1([1,2,3])


    

    




1

In [146]:

    

def insertion_sort2(seq):
    for i in range(1,len(seq)):
        c = seq[i]
        j = i - 1
        while j>=0 and seq[j] > c:
            seq[j+1] = seq[j]
            j-=1
        seq[j+1] = c
    return seq


    

In [147]:

    

l = [4,2,3]


    

In [148]:

    

insertion_sort2(l)


    

    
Out[148]:





[2, 3, 4]

In [ ]:

    




    

In [ ]:

    




    

In [ ]:

    




    

In [ ]:

    




    

In [ ]:

    




    

In [ ]:

    




    

In [ ]: