http://anrs.sacredfir.com/archives/66 你所知的一切... Mon, 24 May 2010 08:52:13 -0500 http://wordpress.org/?v=2.8.4 hourly 1 http://anrs.sacredfir.com/archives/66/comment-page-1#comment-54 admin Fri, 21 Aug 2009 22:17:36 +0000 http://anrs.sacredfir.com/?p=66#comment-54 楼上是虎逼青年，其实我是想写淘淘淘淘，华丽丽的桃...而且你说的博瘾怎么听怎么邪恶... 楼上是虎逼青年，其实我是想写淘淘淘淘，华丽丽的桃…而且你说的博瘾怎么听怎么邪恶…

]]> http://anrs.sacredfir.com/archives/66/comment-page-1#comment-53 hkbarton Fri, 21 Aug 2009 14:51:13 +0000 http://anrs.sacredfir.com/?p=66#comment-53 你最近博瘾来了哇 你最近博瘾来了哇

]]> http://anrs.sacredfir.com/archives/66/comment-page-1#comment-52 admin Fri, 21 Aug 2009 07:24:50 +0000 http://anrs.sacredfir.com/?p=66#comment-52 @seth 还好吧，我觉得可读性还是蛮高的，当然和线性递归比起来是差着一大截... @seth
还好吧，我觉得可读性还是蛮高的，当然和线性递归比起来是差着一大截…

]]> http://anrs.sacredfir.com/archives/66/comment-page-1#comment-51 Seth Fri, 21 Aug 2009 01:46:27 +0000 http://anrs.sacredfir.com/?p=66#comment-51 Tail recursion is efficient because no stack frames are needed, it's simply treated like a "for/while loop", but it's harder to read. Basically, you trade readability for performance, which is hard to take the decision. :) Tail recursion is efficient because no stack frames are needed, it’s simply treated like a “for/while loop”, but it’s harder to read. Basically, you trade readability for performance, which is hard to take the decision.

]]>