Question: Design an algorithm to find the sorted list from two sorted lists of numbers. For example, for the lists 2, 5, 7, 12, 13 ,24
Design an algorithm to find the sorted list from two sorted lists of numbers. For example, for the lists 2, 5, 7, 12, 13 ,24 and 1, 6, 15, 17, 35, the output should be 1, 2, 5, 6, 7, 12, 13 ,15 ,17, 24, 35. What is the maximum number of comparisons your algorithm makes if the lengths of the two given lists are m and n, respectively?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
