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 -~----------~----~----~----~------~----~------~--~---
