Right. So this requires n << m. I am just picky: any better idea if they have similar size? Maybe n+m is the fastest in that case, I am thinking.
- [algogeeks] Re: Fast count same value among two (or more) value ... Kevin
Right. So this requires n << m. I am just picky: any better idea if they have similar size? Maybe n+m is the fastest in that case, I am thinking.