Timeline for Primes and SemiPrimes in Binary
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 26, 2023 at 15:31 | history | edited | Toby Speight | CC BY-SA 4.0 | Spelling and grammar |
| Jun 22, 2019 at 19:39 | comment | added | Wolf Larson | I tested this varying the bit_per_segment value and came to the conclusion that, even though it has a wide and shallow trough, 2**7 seems to offer me the best results from a performance perspective (e.g. shortest total execution time) | |
| Jun 22, 2019 at 19:34 | vote | accept | Wolf Larson | ||
| Jun 22, 2019 at 19:31 | history | edited | Wolf Larson | CC BY-SA 4.0 | Refactored code to incorporate suggestions and make code perform to time and memory constraints |
| Jun 18, 2019 at 10:19 | history | became hot network question | |||
| Jun 18, 2019 at 8:51 | answer | added | Peter Taylor | timeline score: 7 | |
| Jun 18, 2019 at 6:00 | history | tweeted | twitter.com/StackCodeReview/status/1140861939112906753 | ||
| Jun 18, 2019 at 4:28 | answer | added | l0b0 | timeline score: 13 | |
| Jun 18, 2019 at 2:20 | review | First posts | |||
| Jun 18, 2019 at 2:54 | |||||
| Jun 18, 2019 at 2:19 | comment | added | Wolf Larson | Change poe to 3 to see what I'm currently limited to. poe of 4 is what I'm attempting to get to. | |
| Jun 18, 2019 at 2:18 | history | asked | Wolf Larson | CC BY-SA 4.0 |