Timeline for Finding Primes in Java
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:40 | history | edited | CommunityBot |
replaced http://codereview.stackexchange.com/ with https://codereview.stackexchange.com/
|
|
| Aug 3, 2014 at 22:17 | comment | added | Boris the Spider | @fgb I suppose one could do that - although being as it only checks prime factors and the density of primes decreases exponentially along the number line, I'm not sure it would be that much more efficient. | |
| Aug 3, 2014 at 20:13 | comment | added | fgb | Your algorithm appears to be the unfaithful sieve (see cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf). It would be much more efficient to check factors up to the square root of each number instead. | |
| Aug 3, 2014 at 11:06 | history | edited | Boris the Spider | CC BY-SA 3.0 |
edited body
|
| Aug 3, 2014 at 10:51 | history | edited | Boris the Spider | CC BY-SA 3.0 |
added 16 characters in body
|
| Aug 3, 2014 at 10:45 | history | edited | Boris the Spider | CC BY-SA 3.0 |
added 1422 characters in body
|
| Aug 3, 2014 at 10:33 | history | answered | Boris the Spider | CC BY-SA 3.0 |