Merge sorts_exploring

print ("******************************************************************")
def mergeSort(alist):
   print("Splitting ",alist)
   if len(alist)>1:
       mid = len(alist)//2
       lefthalf = alist[:mid]
       righthalf = alist[mid:]
       #recursive call
       mergeSort(lefthalf)
       mergeSort(righthalf)
       i=0
       j=0
       k=0
       while i < len(lefthalf) and j < len(righthalf):
           if lefthalf[i] < righthalf[j]:
               alist[k]=lefthalf[i]
               i=i+1
           else:
               alist[k]=righthalf[j]
               j=j+1
           k=k+1

       while i < len(lefthalf):
           alist[k]=lefthalf[i]
           i=i+1
           k=k+1

       while j < len(righthalf):
           alist[k]=righthalf[j]
           j=j+1
           k=k+1
   print("Merging ",alist)

alist = []
num = int(input('How many items in the list?: '))
for n in range(num):
    numbers = int(input("Enter a number in the list: "))
    alist.append(numbers)
print("My list: " + str(alist))
mergeSort(alist)
print ("******************************************************************")