Prime Number Programming

From	KBH <emptypost@hotmail.com>
Newsgroups	comp.lang.pascal.borland
Subject	Prime Number Programming
Date	2012-07-19 05:38 -0700
Organization	http://groups.google.com
Message-ID	<a3e42bb6-c1d2-4db4-9f1e-243f33a004ef@googlegroups.com> (permalink)

Show all headers | View raw

Here is the subject:

http://www.delphigroups.info/2/e9/3997-2.html

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.

So that poster that jumps on a list of details just misses the point and ends up looking childish. In fact computer code is often demonstrated with the value needed evaulated each time it is needed. It just saves a variable and a line of code in the demonstration.

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 ?

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
.

Back to comp.lang.pascal.borland | Previous | Next — 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