Pathologically Eclectic Rubbish Lister | |
PerlMonks |
Re: Fast Way to find one array in second arrayby Anonymous Monk |
on Aug 15, 2016 at 20:23 UTC ( [id://1169802]=note: print w/replies, xml ) | Need Help?? |
Across the "arrays", the problem size is around 160k. What about the other dimension? How many different "path elements"? In case the dimension of path elements is large, then the (bit)vectors to represent your sets are going to be very sparse (with up to 12 elements chosen). See Comparing two arrays for a treatment of a similar problem.
In Section
Seekers of Perl Wisdom
|
|