Question
(a) Describe an efficient algorithm for finding all common elements in two sorted lists of numbers. For example, for the lists 2, 5, 5, 5
(a) Describe an efficient algorithm for finding all common elements in two sorted lists of numbers. For example, for the lists 2, 5, 5, 5 and 2, 2, 3, 5, 5, 7, the output should be 2, 5, 5. As another example, for the lists 20, 30, 50, 70, 90, 100 and 10, 20, 30, 50, 80, the output should be 20, 30, 50.
You should describe your basic idea in English clearly.
[Hint: You can do this task in the linear time.]
(b) What is the minimum number of comparisons your algorithm makes if the lengths of the two lists are 5 and 7? Present sample lists of the minimum number of comparisons.
(c) What is the maximum number of comparisons your algorithm makes if the lengths of the two lists are 5 and 7? Present sample lists of the maximum number of comparisons.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started