Timeline for Project Euler problem #14 (longest Collatz chain) in Swift
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 24, 2017 at 21:41 | comment | added | Martin R | Also have a look at codereview.stackexchange.com/a/157366/35991 if you plan to run the code on a 32-bit platform. | |
| Sep 24, 2017 at 20:53 | answer | added | Martin R | timeline score: 1 | |
| Sep 24, 2017 at 16:49 | history | edited | Jamal |
edited tags
|
|
| Sep 22, 2017 at 7:36 | comment | added | mobs_boss | I did find out that this must be the issue. Thanks for your help. | |
| Sep 21, 2017 at 17:35 | comment | added | Zack | You are recalculating the same values over and over. For example, if 12345 has a collatz sequence that is 50 long, and then later you find that 15001 has 12345 in it's sequence, you know that there are 50 more steps until it terminates. Don't recalculate them all, use memoization | |
| Sep 21, 2017 at 12:29 | history | edited | mobs_boss | CC BY-SA 3.0 |
added 4 characters in body
|
| Sep 21, 2017 at 12:23 | history | edited | mobs_boss | CC BY-SA 3.0 |
deleted 7 characters in body
|
| Sep 21, 2017 at 7:25 | history | edited | 200_success | CC BY-SA 3.0 |
edited tags; edited title
|
| Sep 21, 2017 at 6:42 | review | First posts | |||
| Sep 21, 2017 at 7:35 | |||||
| Sep 21, 2017 at 6:41 | history | asked | mobs_boss | CC BY-SA 3.0 |