import random
import time
import sys
def merge(ll, rl):
    result = []
    i=0
    j=0
    while i < len(ll) and j < len(rl):
        if ll[i] <= rl[j]:
            result=result+[ll[i]]
            i = i + 1
        else:
            result=result+[rl[j]]
            j = j + 1
    if (i<len(ll)):
        result = result + ll[i:]
    else:
        result = result + rl[j:]
    return result

def mergesort(list):
    if len(list) < 2:
        return list
    else:
        mp = len(list)//2
        list1 = mergesort(list[:mp])
        list2 = mergesort(list[mp:])
        return merge(list1, list2)
p=[]
for i in range(6000):
  p=p+[random.randrange(-500,500)]
start=time.clock()
p=mergesort(p)
#print(p)
print (time.clock()-start, 'seconds')