import time

def insertion_sort(A):
    n = len(A)
    for j in range(1, n):
        key = A[j]
        i = j - 1
        while i > -1 and A[i] > key:
            A[i + 1] = A[i]
            i = i - 1
        A[i + 1] = key

def sort_with_time(A):
    st = time.clock()
    insertion_sort(A)
    et = time.clock()
    return et - st


def time_sort(n):
    print (n)
    x = numpy.random.uniform(size = n)
    return sort_with_time(x)