Good point. I had assumed that the array is sorted. Although not mentioned in the original email, seeing the 1,2,3...n progression led me to assume so. If the array is not sorted, I would definately sort first.
Perhaps there is a method where I can scan for missing numbers while sorting, or loading into a btree? I don't have any ideas how this would be done, though. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
