Timeline for Project Euler #3 in Java
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 10, 2020 at 13:24 | history | edited | CommunityBot |
Commonmark migration
|
|
| Apr 3, 2020 at 2:38 | history | protected | Jamal | ||
| Jan 23, 2015 at 23:49 | history | edited | TheCoffeeCup | CC BY-SA 3.0 |
added 2 characters in body
|
| Dec 24, 2014 at 18:02 | answer | added | Alnitak | timeline score: 3 | |
| Dec 24, 2014 at 14:27 | comment | added | Alnitak | @MannyMeng the square root is essential - the problem is in your algorithm. In particular it's not necessary to perform a primality test for each iteration. | |
| Dec 23, 2014 at 17:22 | vote | accept | TheCoffeeCup | ||
| Dec 23, 2014 at 15:19 | answer | added | thepace | timeline score: 3 | |
| Dec 23, 2014 at 6:13 | answer | added | JS1 | timeline score: 5 | |
| Dec 23, 2014 at 6:10 | answer | added | wei2912 | timeline score: 13 | |
| Dec 23, 2014 at 3:26 | answer | added | h.j.k. | timeline score: 2 | |
| Dec 23, 2014 at 3:22 | comment | added | h.j.k. | good point, penalties of calculating square root... | |
| Dec 23, 2014 at 3:10 | comment | added | TheCoffeeCup | @h.j.k. That didn't really help. It actually increased the time to calculate by about 100,000,000 nanoseconds. | |
| Dec 23, 2014 at 3:07 | comment | added | h.j.k. |
This is too short to be a full-fledged answer so here it goes: you do not need to loop to half of l inside isPrime(), just its square root will do.
|
|
| Dec 23, 2014 at 2:48 | history | asked | TheCoffeeCup | CC BY-SA 3.0 |