Anonymous user
User talk:Sonia: Difference between revisions
I think that's my fault
(small stuff) |
(I think that's my fault) |
||
Line 4:
Good call on removing that "gratuitous dig on recursion" in the Factorial task. What a foolish thing to say, especially given that tail recursive solutions are possible with the accumulator-passing trick.[[Special:Contributions/24.85.131.247|24.85.131.247]] 06:50, 6 January 2012 (UTC)
: Thank you. The same claim is in in the Fibonacci task, and I agonized over whether to remove that as well. I don't like the wording, and of course efficient recursive solutions exist there as well, but it is true that simple doubly recursive solutions rapidly bog down. —[[User:Sonia|Sonia]] 16:54, 6 January 2012 (UTC)
::I think I might have added both of those notes long ago. I hadn't had any experience with tail recursive optimization and was just basing it on my limited knowledge. Maybe it would be better if it specified that doubly recursive solutions slow down quickly? For what it's worth, [[Recursion]] seems to handle it better. Any improvements to language-neutrality in any of those pages would be nice. --[[User:Mwn3d|Mwn3d]] 17:46, 6 January 2012 (UTC)
| |||