Given two sorted arrays A and B.
Find the intersection of these arrays A and B.
I heard that intersection can be found by using a variation of merge routine of the merge sort.
Can you explain please in details and with example??
Printable View
Given two sorted arrays A and B.
Find the intersection of these arrays A and B.
I heard that intersection can be found by using a variation of merge routine of the merge sort.
Can you explain please in details and with example??
Why not describe the algorithm you have in mind? It should be pretty easy to figure out, methinks.
I just gave a hint. I do not know this algorithm.
If someone has any way to do that , so I will be happy to learn and know that .
Thank you