Re: Prime number in assembly?

From: Herman Dullink (hd5_at_hetnet.nl)
Date: 07/11/04 

Date: Sun, 11 Jul 2004 12:25:03 +0100

> 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.
Not more efficient as in any other language. For this type of problem,
it;s the algorithm that determines the efficiency, not the language.
Assembly can only help where platform specific features are not
available through the HLLs and compiler's optimizers.

H

Relevant Pages

  • Re: Prime number in assembly?
    ... >it;s the algorithm that determines the efficiency, not the language. ... >available through the HLLs and compiler's optimizers. ...
    (alt.lang.asm)
  • Re: Where did the prophet really live?
    ... features were in the spoken language or not. ... Now the point that Macdonald makes is that Sabaic was the prestige ... medieval arab historians had reported inscriptions ...
    (soc.religion.islam)
  • Re: Is C99 the final C? (some suggestions)
    ... I can't think of a single feature in C99 that would come as ... There are a number of features in C99 that I will steer away from if ... > * a library function that allows the retrieval of the size of a memory ... With the restrictions of the C language, I think you are going to find ...
    (comp.lang.c)
  • Re: Equality, Assignment and The Emperors New Clothes
    ... Unfortunately, the features were designed ... the basic features of the language so that they can work together, ... suppose the language designers create a new feature to solve that same ... In R5RS, three pages or used ...
    (comp.lang.scheme)
  • Re: OT: compilers, interpreters, and VMs
    ... by people used to languages that don't have these features. ... a language should absorb each and every feature? ... run-time code generation, anonymous functions, exceptions and so on. ... general-purpose language should not include dynamic code generation. ...
    (comp.lang.misc)