Say that there are two sorted lists: A and B.The number of entries in A and B can vary. (They can be very small/huge. They can be similar to each other/significantly different).What is the known to be the fastest algorithm for this functionality?Can any one give me an idea or reference?
The fastest algorithm for intersection of two sorted lists?
algorithms;lists