Timeline for Find primes faster (Java)
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 12, 2018 at 2:51 | comment | added | maaartinus | In Java, I wouldn't bother with method call overhead. Inlining is pretty powerful and if a method doesn't get inlined, then there may be good reasons. +++ While I agree that over- and under-shooting is problematic, an optimized sieve wins hands down (under one minute for primes up to a few billions). +++ That all said, +1. | |
| Jan 12, 2018 at 0:27 | history | answered | mdfst13 | CC BY-SA 3.0 |