the xor will not work if there are duplicates (not sure if that means 2 times 3 times etc) the statement is incomplete in the question
Best Regards Ashish Goel "Think positive and find fuel in failure" +919985813081 +919966006652 On Mon, Jul 18, 2011 at 6:28 PM, Dumanshu <[email protected]> wrote: > Hi > > sry for not being so clear with the problem statement. > > The list of numbers may have repetitions. Lots of numbers can be > missing from the list, you just need to output any one. > > Regards > Dumanshu > BITS-Pilani > > On Jul 18, 5:28 pm, ankit sambyal <[email protected]> wrote: > > The question says :" find the integer that is not there in the list." > > So it seems that there is only one missing integer. Also the list > > contains 2^32 integers and if we take all possible integers, assuming > > an integer takes 4 bytes, we get 2^32 integers. So, if 1 integer is > > missing in the list, it means that at least 1 no. is repeating in the > > list. So, the xor method fails in this case. > > -- > 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. > > -- 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.
