Timeline for Prime Number Speed
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 4, 2015 at 6:03 | history | edited | Heslacher | CC BY-SA 3.0 |
deleted 3 characters in body; edited tags
|
| Jun 18, 2014 at 17:34 | history | edited | svick | CC BY-SA 3.0 |
rm tag from title
|
| Jun 10, 2014 at 19:27 | comment | added | John Davis | @hatchet Thanks, nice catch. However, changing "int half = count/2+1" to "int half = count/2-1" fixes that, but thats not the reason for a 25% speed boost for Atkin. | |
| Jun 10, 2014 at 19:15 | answer | added | user39138 | timeline score: 3 | |
| Jun 10, 2014 at 16:31 | comment | added | user39138 | @JohnDavis - Your code above returns primes past the limit. I'm assuming that count is the upper limit. With a count of 10, your function returns 2,3,5,7,11,13. | |
| Jun 10, 2014 at 13:05 | comment | added | John Davis | I am, however I'm not yet sure of WHY its faster. I've read that it can be slower depending on the implementation, so I'm still doing research in this area... | |
| Jun 10, 2014 at 3:53 | answer | added | user33306 | timeline score: 2 | |
| Jun 9, 2014 at 21:56 | review | First posts | |||
| Jun 9, 2014 at 23:04 | |||||
| Jun 9, 2014 at 21:48 | comment | added | Greg Hewgill | Are you familiar with the Sieve of Atkin? | |
| Jun 9, 2014 at 21:36 | history | asked | John Davis | CC BY-SA 3.0 |