This is a very old problem in this group.
The solution is simple. Here is an example
{1,3} missing 2
1 XOR 3 XOR 1 XOR 2 XOR 3 = 2
-----Original Message-----
From: [email protected] [mailto:[EMAIL PROTECTED] On
Behalf Of Joe
Sent: Thursday, August 24, 2006 7:56 PM
To: Algorithm Geeks
Subject: [algogeeks] Need an algorithm to find the missing numbers.
Hi,
In a sequence o,f from 1 to n (1,2,3,...n) numbers, we need to find the
missing numbers. There will not be duplicates.
Can you please suggest an algorithm.
Thanks,
Joe.
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
