text: def merge_lists(my_list, alices_list):
  
      # set up our merged_list
      merged_list_size = len(my_list) + len(alices_list)
      merged_list = [None] * merged_list_size
  
      current_index_alices = 0
      current_index_mine = 0
      current_index_merged = 0
  
      while current_index_merged < merged_list_size:
  
          is_my_list_exhausted = current_index_mine >= len(my_list)
          is_alices_list_exhausted = current_index_alices >= len(alices_list)
  
          if not is_my_list_exhausted and (is_alices_list_exhausted or \
                  (my_list[current_index_mine] < alices_list[current_index_alices])):
  
              merged_list[current_index_merged] = my_list[current_index_mine]
              current_index_mine += 1
  
          else:
              merged_list[current_index_merged] = alices_list[current_index_alices]
              current_index_alices += 1
  
          current_index_merged += 1
  
      return merged_list
  
  my_list = [1,3,5,7,11]
  alice_list= [2,5,6,8,12]
  print merge_lists(my_list,alice_list)
  