Timeline for Euler Project 14 Longest Collatz Sequence [closed]
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 23, 2018 at 11:16 | vote | accept | johnashu | ||
| Jul 22, 2018 at 17:58 | history | closed |
200_success yuri hjpotter92 Ludisposed Graipher |
Not suitable for this site | |
| Jul 20, 2018 at 18:28 | answer | added | Kirk Strauser | timeline score: 4 | |
| Jul 20, 2018 at 17:08 | answer | added | AJNeufeld | timeline score: 1 | |
| Jul 20, 2018 at 16:34 | history | edited | 200_success | CC BY-SA 4.0 |
edited tags; added 96 characters in body
|
| Jul 20, 2018 at 15:58 | review | Close votes | |||
| Jul 22, 2018 at 17:58 | |||||
| Jul 20, 2018 at 15:35 | comment | added | AJNeufeld |
Does the main loop even function properly? It is comparing the length of the collatz sequence with largest, but storing the index, not the sequence length, in largest. Apples and oranges.
|
|
| Jul 20, 2018 at 15:18 | answer | added | SylvainD | timeline score: 5 | |
| Jul 20, 2018 at 15:00 | comment | added | SylvainD | Did this code work for you ? First I had a RecursionError and then, after changing the recursion limit from 1000 to 100000, I had a segmentation fault :-( | |
| Jul 20, 2018 at 14:47 | history | edited | SylvainD | CC BY-SA 4.0 |
added 53 characters in body
|
| Jul 20, 2018 at 13:15 | comment | added | jonrsharpe | A few ideas: 1. don't create a new instance each time; 2. look into caching/memoization/dynamic programming; and 3. simplify the code to remove the redundant method calls, there's a lot of indirection that I don't think makes it easier to follow. | |
| Jul 20, 2018 at 11:38 | history | asked | johnashu | CC BY-SA 4.0 |