User talk:Sonia: Difference between revisions
Content added Content deleted
No edit summary |
(small stuff) |
||
| Line 3: | Line 3: | ||
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) |
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) |
|||
Revision as of 16:54, 6 January 2012
I see you've made a few small edits recently. For small stuff, please use the "This is a minor edit" checkbox. --glennj 12:49, 4 December 2011 (UTC)
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.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. —Sonia 16:54, 6 January 2012 (UTC)