Tru doing this:- 1.Take LSbit of all numbers and xor them. 2.Loop statment 1 for all bits. 3. U'll have the xor of all numbers present in A. 4. Start xor with numbers 1-N of the result above. 5. The number left after 5 is the number missing.
For more see this:- http://www.orkut.com/CommMsgs.aspx?cmm=1175763&tid=2431019257685994698 --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
