@Shiva: Using an integer array a[100000], initialized to 0, read through the file and for each number n, increment a[n%100000]. At the end of the file, find any k such that a[k] != 10000. Then read through the file again. For any number n such that n%100000 == k, set a[n/ 100000] = -1. At the end of file, find any j < 10000 such that a[j] >= 0. Then 100000 * j + k is a number that is missing from the file.
Dave On Oct 27, 10:25 am, "shiva@Algo" <[email protected]> wrote: > Given a file containing roughly 300 million social security > numbers(9-digit numbers), find a 9-digit number that is not in the file. > You have unlimited drive space but only 2megabytes of RAM at your > disposal. -- 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.
