In [55]:

    

def findIndex(A, p, q, v):
    mid = (p + q)//2
    if A[mid] == v:
        return mid
    elif p == q:
        if A[mid] > v:
            return mid
        return mid + 1
    elif A[mid] > v:
        return findIndex(A, p, mid, v)
    return findIndex(A, mid + 1, q, v)


    

In [56]:

    

def isort(A):
    for j in range(1, len(A)):
        key = A[j]
        i = j - 1
        index = findIndex(A[:], 0, j - 1, key)
        while i > index - 1:
            A[i+1] = A[i]
            i = i -1
        A[i + 1] = key


    

In [58]:

    

A = list(range(100, -100, -1))
#A = [ 5, 4, 2, 7, 3, 1, 9]
isort(A)
print (A)


    

    




[-99, -98, -97, -96, -95, -94, -93, -92, -91, -90, -89, -88, -87, -86, -85, -84, -83, -82, -81, -80, -79, -78, -77, -76, -75, -74, -73, -72, -71, -70, -69, -68, -67, -66, -65, -64, -63, -62, -61, -60, -59, -58, -57, -56, -55, -54, -53, -52, -51, -50, -49, -48, -47, -46, -45, -44, -43, -42, -41, -40, -39, -38, -37, -36, -35, -34, -33, -32, -31, -30, -29, -28, -27, -26, -25, -24, -23, -22, -21, -20, -19, -18, -17, -16, -15, -14, -13, -12, -11, -10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100]

In [ ]: