Timeline for Find whether a number is happy or not?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot | Commonmark migration | |
| Apr 27, 2011 at 1:52 | comment | added | dmckee --- ex-moderator kitten | I love the naivety of this approach. And the abuse of for loops is beautiful. | |
| Apr 25, 2011 at 22:11 | comment | added | Joey | Appears to work fine on Windows 7 with MSVC 10. Doesn't consume any notable amount of memory while compiling and only marks the array in the page file (something that sounds way safer than the story you linked about memory overcommitting suggests ;-)). | |
| Apr 25, 2011 at 21:22 | comment | added | Peter Taylor | I'm curious: why does compiling it require so much RAM? | |
| Apr 25, 2011 at 20:51 | comment | added | mellamokb | @Peter: I suppose the approach is to (naively) catch a cycle for any number in the allowed input range from 1 to 1,000,000,000. But I agree that in light of happy number theory, the only check necessary is if the number 4 is reached, because that's the only cycle that will ever occur. | |
| Apr 25, 2011 at 20:32 | comment | added | Peter Olson | Why would you need anywhere close to that amount of memory for this problem? | |
| Apr 25, 2011 at 19:41 | history | answered | Joey Adams | CC BY-SA 3.0 |