K
kevinmr
To all -
I have two arrays of strings one of length M and the other of length
N; N > M. Ther arrays will be on the order of 1 million for N array
and ~50000 for the M array. Can someone describe to me a fast
algorithm to find the intersection of the arrays? Currently I am using
ArrayList in VC.NET.
Thanks in advance
I have two arrays of strings one of length M and the other of length
N; N > M. Ther arrays will be on the order of 1 million for N array
and ~50000 for the M array. Can someone describe to me a fast
algorithm to find the intersection of the arrays? Currently I am using
ArrayList in VC.NET.
Thanks in advance