KBH
2012-07-19 12:38:23 UTC
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
.
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
.