The intersection of two sorted arrays.

Posted by user288609 on Stack Overflow See other posts from Stack Overflow or by user288609
Published on 2010-03-08T08:52:01Z Indexed on 2010/03/08 9:06 UTC
Read the original article Hit count: 323

Given two sorted arrays: A and B. The size of array A is La and the size of array B is Lb. How to find the intersection of A and B? If La is much bigger than Lb, then will there be any difference for the intersection finding algorithm?

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about c++