Talk:Hofstadter Q sequence: Difference between revisions
Content added Content deleted
(added recursion limit issue) |
(→Recursion limit issue: Updated the task) |
||
Line 5: | Line 5: | ||
This doesn't occur in the calculations necessary to solve the tasks since this way the cache is filled ascending. |
This doesn't occur in the calculations necessary to solve the tasks since this way the cache is filled ascending. |
||
Maybe the task description should be changed whether it is required to accommodate this. --[[User:AlexLehm|AlexLehm]] 09:53, 28 October 2011 (UTC) |
Maybe the task description should be changed whether it is required to accommodate this. --[[User:AlexLehm|AlexLehm]] 09:53, 28 October 2011 (UTC) |
||
:I updated the task. The recursive Python solution has a similar issue but with Pythons recursion limit being set at only 1000 by default. The extra credit solution gets around this. |
|||
:I think that solutions should address such issues in an extendable way if at all possible (not hard-coding something that works just for this tasks value of n). --[[User:Paddy3118|Paddy3118]] 14:38, 28 October 2011 (UTC) |