While digesting can greatly reduce the number of comparisons
That would only be true if the OP was looking for exact matches. He isn't.
He's looking for the best matches, where 'best' is defined in terms of the number of set bits in matching positions. No hashing, digesting nor sorting approach to this problem is possible.
Every X must be fully compared against every Y.
In reply to Re^3: Comparing two arrays
by BrowserUk
in thread Comparing two arrays
by baxy77bax
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |