wael.salman
June 11th, 2009, 07:24 PM
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??
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??