Given a list of numbers , How to find the max(x[i] XOR x[j]) in the list. Any solution less than O(n^2)?
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
