Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
What if we have only 10 MB memory?
It’s possible to find a missing integer with just two passes of the data set. We can divide up the integers into blocks of some size (we’ll discuss how to decide on a size later). Let’s just assume that we divide up the integers into blocks of 1000. So, block 0 represents the numbers 0 through 999, block 1 represents blocks 1000 - 1999, etc. Since the range of ints is finite, we know that the number of blocks needed is finite.

Possibly Related Threads...
Thread Author Replies Views Last Post
  Which part of JVM will allocate the memory for a java program.? beingchinmay 0 1,222 02-10-2016, 02:57 PM
Last Post: beingchinmay

Forum Jump:

Users browsing this thread: 1 Guest(s)