I think I find the max and then print max + 1 is not a correct strategy because overflow can occur or find the min and print min-1 underflow can occur.
If you use a bitset, you can store all the values that appear in 10Mb. I believe that these integers are in the file are integers that are represented in 32bit. Am i correct? Wladimir Araujo Tavares *Federal University of Ceará * On Thu, Mar 17, 2011 at 2:53 PM, Don <dondod...@gmail.com> wrote: > 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" <arpitg1...@gmail.com> 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 <shashank7andr...@gmail.com> 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 algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
