Everyone , I have posted the solution for this problem in O(n) also with O(nlogn) . Just check my previous mails in this loop mail.
--- Peeyush Bishnoi On 8/16/07, Chonku <[EMAIL PROTECTED]> wrote: > > I think the only faster way I know off is by using a hashset which uses > O(nlog(n/m)) time but the value comes out to be numerically closer to > O(nlogn). > > On 8/16/07, dsha <[EMAIL PROTECTED]> wrote: > > > > > Hi there, > > > > I'm interested in the following problem: there is an array of integers > > that contains each element only once except for one element that > > occurs exactly twice. Is there a way to find this element faster than > > O(n*log n) and with constant extra memory? If no, how can I prove it? > > > > Thanks in advance for ideas. > > > > > > > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
