Groups | Search | Server Info | Keyboard shortcuts | Login | Register

Groups > comp.lang.pascal.borland > #106

Re: Prime Number Programming

Show all headers | View raw

On 2012-07-19, KBH <emptypost@hotmail.com> wrote:
> Here is the subject:
>
> http://www.delphigroups.info/2/e9/3997-2.html

No that is random url with a very long discussion.

> And when I say that I have prime number code that does not have any
> unnecessary operations I mean that all divisions are by prime numbers. 
> But then that poster does take a larger view and seems to say that overall
> efficiency doesn't really matter.  Isn't that more childish ?

Well, of course performance doesn't matter, otherwise one would use an
optimizing compiler and not an old 16-bit TP.

> But I like the trial division prime number code even though I have moved
> on to other code.  Once the trial division was run one time then it had
> prime numbers in memory array to use for the next runs.  So it could get
> faster in use but didn't have files of prime numbers that could be deleted

I'm not sure what the question in this post is?

Back to comp.lang.pascal.borland | Previous | Next — Previous in thread | Next in thread | Find similar

Thread

Prime Number Programming KBH <emptypost@hotmail.com> - 2012-07-19 05:38 -0700
  Re: Prime Number Programming Marco van de Voort <marcov@toad.stack.nl> - 2012-07-19 14:06 +0000
  Re: Prime Number Programming emptypost@hotmail.com - 2012-07-19 17:15 -0700

csiph-web