Anonymous user
Talk:Hofstadter Q sequence: Difference between revisions
→Recursion limit issue: and it wasn't difficult anyway
(→Recursion limit issue: Updated the task) |
(→Recursion limit issue: and it wasn't difficult anyway) |
||
Line 8:
: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)
:: My view is: since examples all define <code>Q</code> as a function, it should try its best to ensure the return values don't depend on call history, because that's what one tends to expect. It's best not to (unnecessarily) surprise people. --[[User:Ledrug|Ledrug]] 16:25, 28 October 2011 (UTC)
| |||