Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have 2 large integer arrays. I have to get the difference of these arrays(i.e. elements in 2nd array, not in 1st or vice versa). I am implementing a linear search and storing the difference in an array. Is there any way I can do it faster (Linear time)?
It’s easy to get O(n+m) time if you put one array into a hash set and then run through the other array, probing the hash set. Of course, if your arrays were sorted, then you could have O(n+m) directly.