| Author |
Message |
bwgroom
|
 Posted: Thu Nov 04, 2004 8:31 pm Post subject: Prime # Outputter |
|
|
Here is a program i just made cuz i was bored... It outputs all the prime numbers from 1 - (inputted value)
Have fun 
| Description: |
|
Download |
| Filename: |
Prime Finder.t |
| Filesize: |
1.06 KB |
| Downloaded: |
164 Time(s) |
|
|
|
|
|
 |
Sponsor
Sponsor
|
|
|
Tony
|
|
|
|
|
bwgroom
|
| Posted: Thu Nov 04, 2004 8:48 pm Post subject: (No subject) |
|
|
| What do ya mean fix it? whats there to fix?
|
|
|
|
|
|
AsianSensation
|
| Posted: Thu Nov 04, 2004 9:03 pm Post subject: (No subject) |
|
|
| yeah, it's too slow. There are other methods, that are faster in finding primes then the one you posted. Essentially, you just modded the number by all the ones less than it. There are better ways. Good job at trying though.
|
|
|
|
|
|
Tony
|
| Posted: Thu Nov 04, 2004 9:07 pm Post subject: (No subject) |
|
|
bwgroom wrote: whats there to fix?
read the two links posted 
|
Tony's programming blog. DWITE - a programming contest. |
|
|
|
|
bwgroom
|
| Posted: Thu Nov 04, 2004 9:18 pm Post subject: (No subject) |
|
|
lol im a noob programmer.... i just put it up an easy way (because i didn't know of a better way)
O..... i didn't notice the 2 links
|
|
|
|
|
|
bwgroom
|
| Posted: Thu Nov 04, 2004 10:09 pm Post subject: (No subject) |
|
|
Alright i used your theory of square routeing the values... i uploaded the faster one
i modified your way of calculating it to accomidate my output layout...
now its fast and looks nice
|
|
|
|
|
|
Danny
|
| Posted: Tue Nov 09, 2004 10:43 pm Post subject: (No subject) |
|
|
| I like it. Now I know every prime number from 1 to 5. Congrats holmes!
|
|
|
|
|
|
Sponsor
Sponsor
|
|
|
|
Register
Wiki
Blog
Search
Turing
Chat Room
Members
