L = [1,2,55,0,9,65,7,3,4,1,2]

def reverse(L):
    if len(L) != 0:
        temp = L[0]
        del L[0]
        reverse(L)
        L.append(temp)
    return L

def merge(left,right):
	result = []
	i,j = 0, 0
	while i<len(left) and j< len(right):
		if left[i] <= right[j]:
			result.append(left[i])
			i+=1
		else:
			result.append(right[j])
			j+=1

	result += left[i:]
	result += right[j:]
	return result


def mergesort(lst):
	if(len(lst) <= 1):
		return lst
	mid = int(len(lst)/2)
	left = mergesort(lst[:mid])
	right = mergesort(lst[mid:])
	return merge(left,right)


##print(reverse(L))
##print(mergesort(L))