pb1

def merge_lists(list_a, list_b):
   # TO DO
   a, b = 0, 0
   merged = []
   while(a < len(list_a) and b < len(list_b)):
      merged.append(min(list_a[a], list_b[b]))
      if(list_a[a] < list_b[b]): a += 1
      else: b += 1

   merged.extend(list_b[b:]) if(a == len(list_a)) else merged.extend(list_a[a:])

   return merged
###################################################################################
##################################################################################

from merge import merge_lists as merge

def sort(my_list):
    # TO DO
    if(len(my_list) == 1):
        return my_list
    left = my_list[:int(len(my_list)/2)]
    right = my_list[int(len(my_list)/2):]
    my_list = merge(sort(left), sort(right))

    return my_list