Timeline for Prime sieve in Rust
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 28, 2023 at 16:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 30, 2023 at 17:25 | comment | added | Rick Davin | One of the more common optimizations is to only process up to the square root of (limit + 1). After that point, anything past limit + 1 is either properly flagged as prime or not.. With a limit of 100 milliion, this means you can stop after 31622 iterations. Another optimization is to only process odd numbers or let let the nums array be odds only (half the space required). | |
| May 29, 2023 at 15:27 | answer | added | cafce25 | timeline score: 2 | |
| May 29, 2023 at 12:59 | history | edited | manungsa | CC BY-SA 4.0 |
add the new code
|
| May 29, 2023 at 8:25 | history | edited | manungsa |
add tag
|
|
| May 29, 2023 at 6:39 | history | edited | manungsa | CC BY-SA 4.0 |
add the output of time command
|
| May 29, 2023 at 4:52 | history | asked | manungsa | CC BY-SA 4.0 |