1. Engineering
  2. Computer Science
  3. problem 1 15 points you have two sorted lists of...

Question: problem 1 15 points you have two sorted lists of...

Question details

Problem #1: (15 points) You have two sorted lists of integers, L, and L2. You know the lengths of each list, L1 has length N, and L2 has length N2 (a) Design an efficient algorithm (only pseudocode) to output a sorted list L L2 (the intersection of L and L2). (b) If you know that N2> Ni. What is the running time complexity of your algorithm? Justify Important Note For this problem, you dont need to submit any implementation in Java. Only the pseudocode of your algorithm is required.
Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution