Anonymous user
Talk:Hofstadter Q sequence: Difference between revisions
→found the 100000th term,any news?: added some comments.
(→found the 100000th term,any news?: fixed malformed link; also, huh?) |
(→found the 100000th term,any news?: added some comments.) |
||
Line 13:
: This is not challenge site, and the task is not meant to be a challenge, especially not the 100,000th term, which many of the code examples on the task can already do. That number is mentioned somewhere on this talk page because it causes very deep recursions and stack overflow if you use a purely recursive method, but it's nothing special. --[[User:Ledrug|Ledrug]] ([[User talk:Ledrug|talk]]) 20:36, 3 June 2015 (UTC)
:: Indeed, I just checked, and as of today, only 5 computer programming examples (out of 49) ''didn't'' execute their programs with (or for) 100,000 terms. It should be noted that this Rosetta Code task didn't specifically ask for (displaying) the 100,000<sup>th</sup> term, so almost every example didn't show it. I modified the three REXX programming examples to show the 100,000<sup>th</sup> term; it was a very minor addition to one of the existing REXX statement. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 22:07, 3 June 2015 (UTC)
==Python non-recursive solution==
| |||