fork download
  1. # your code goes here
  2.  
  3. list1 = ["admirers", "astir", "black", "dither", "drink", "hoagies", "jolts"]
  4. list1_ = ["okra", "premise", "stickers", "surfaced", "swarm", "wilts", "wrap"]
  5. list2 = ["ark", "children's", "cuirass", "for", "hoe", "isomer", "lane"]
  6. list2_ = ["lords", "nocturnes", "riddle", "sat", "sole", "trionym", "trope"]
  7.  
  8.  
  9.  
  10. def merge_sorted_lists(list1, list2):
  11. merged_list = []
  12. i, j = 0, 0
  13.  
  14. # Traverse both lists and merge them
  15. while i < len(list1) and j < len(list2):
  16. if list1[i] < list2[j]:
  17. merged_list.append(list1[i])
  18. i += 1
  19. else:
  20. merged_list.append(list2[j])
  21. j += 1
  22.  
  23. # If any elements remain in list1
  24. while i < len(list1):
  25. merged_list.append(list1[i])
  26. i += 1
  27.  
  28. # If any elements remain in list2
  29. while j < len(list2):
  30. merged_list.append(list2[j])
  31. j += 1
  32.  
  33. return merged_list
  34.  
  35. l3 = merge_sorted_lists(list1, list2)
  36. l4 = merge_sorted_lists(list1_, list2_)
  37.  
  38. print()
  39. print(l3)
  40. print()
  41. print(l4)
Success #stdin #stdout 0.09s 14100KB
stdin
Standard input is empty
stdout
['admirers', 'ark', 'astir', 'black', "children's", 'cuirass', 'dither', 'drink', 'for', 'hoagies', 'hoe', 'isomer', 'jolts', 'lane']

['lords', 'nocturnes', 'okra', 'premise', 'riddle', 'sat', 'sole', 'stickers', 'surfaced', 'swarm', 'trionym', 'trope', 'wilts', 'wrap']