Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.lang.asm.x86    |    Ahh, the lost art of x86 assembly    |    4,675 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 3,476 of 4,675    |
|    Terje Mathisen to James Van Buskirk    |
|    Re: Fast Fizz Buzz program    |
|    20 Jul 18 10:54:47    |
      From: terje.mathisen@nospicedham.tmsw.no              James Van Buskirk wrote:       > "fizz buzz" wrote in message       > news:f32b85f8-e105-4869-bb7e-456c2d525981@googlegroups.com...       >       >> According to this logic, fastest prime number calculating algorithm       >> would just print text file with already calculated prime numbers.       >       > Whoa, you can calculate and format the primes via the Sieve of       > Eratosthenes way faster than you can read the data off disk.       >       Exactly right, and we have the same case here:              As long as you get above 10-100K numbers it will be much faster to       calculate the output on the fly instead of loading it from a disk file.              Terje              --       - |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca