Question: 2. Design an algorithm to find all the common elements in two alphabetically sorted lists of characters. For example, for the lists aabcce and accde,

 2. Design an algorithm to find all the common elements in

2. Design an algorithm to find all the common elements in two alphabetically sorted lists of characters. For example, for the lists "aabcce" and "accde", the output should be "acce". 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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!