This only works if the file is sorted. If the file starts out with values 5,7,6,... and never contains another 7, the result will be 7, which is in the file.
On Mar 17, 12:19 pm, "arpit.gupta" <[email protected]> wrote: > read the first no. . > now ans= first no +1; > if now ans is encountered while reading the next nos. add 1 to ans. > i.e. ans++; > > On Mar 17, 2:18 am, bittu <[email protected]> wrote: > > > Given an input file with four billion integers, provide an algorithm > > to generate an integer which is not contained in the file. Assume you > > have 1 GB of memory. > > > 2nd Part > > What if you have only 10 MB of memory? > > > Thank > > Shashank > > -- 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.
