I am kind of disagree: we do not need to read through all the (n+m) already sorted numbers, right? I remember someone at somewhere saying it only need (nlogm) time, which will save a lot if one of the array is short. Any idea of this?
- [algogeeks] Re: Fast count same value among two (or more... Kevin
