Prime number in assembly?

From: Gyps (gyps_rueppelli_at_yahoo.com)
Date: 07/11/04 

Date: 10 Jul 2004 21:25:44 -0700

Hello...

I would like to know if there is an efficient way to compute
in assembly, prime numbers within a specified range...say from
50,000 to 100,000 or anything else.

I could certainly implement the standard 'Sieve' method but
it appears to be inefficient. Is there a better method. I am
currently using NASM...

Thanks!

Relevant Pages

  • Re: input from keyboard
    ... most from the Intel Standard. ... NASM is not the standard. ... syntax isn't even close to NASM's. ... Those assemblers are far more powerful ...
    (alt.lang.asm)
  • Re: F2k3 Environment Variable Support
    ... > candidate for inclusion in the standard. ... > ) to be such an inefficient means that they ... > windows can do will be as messy or inefficient as that (but, ... TimC -- http://astronomy.swin.edu.au/staff/tconnors/ ...
    (comp.lang.fortran)
  • Re: Segfault City
    ... C offers no guarantee that there is any character with a code point ... Not those exact words, but yes, it's true that the Standard offers no such ... but I am in the mood to write a Sieve. ... Number of primes in the sieve: ...
    (comp.lang.c)
  • Re: Mystery rejection, 3-d prime counting function
    ... > counting primes. ... huge sieve of the primes and count them. ... composite numbers, so it is a significant step forward. ... So it is not really inefficient, it is just very inefficient compared to ...
    (sci.math)
  • Re: Mystery rejection, 3-d prime counting function
    ... > counting primes. ... huge sieve of the primes and count them. ... composite numbers, so it is a significant step forward. ... So it is not really inefficient, it is just very inefficient compared to ...
    (sci.physics)