<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel>
<title>Comments on snippet: 'Large Factorials in LISP'</title>
<link>http://snipplr.com</link>
<description>Snipplr comments feed'</description>
<language>en-us</language>
<pubDate>Sat, 25 May 2013 17:38:05 GMT</pubDate>
<item>
<title>jcubic said on 8/25/10</title>
<link>http://snipplr.com/view/4534/large-factorials-in-lisp/</link>
<description><![CDATA[ Recursive function use stack. this is stack-less version of factorial function which should work for very large factorials (like 10000 and more) which use tail recursion (which is replace to iteration by compiler)      
      
(defun ! (n &amp;optional (product 1))       
   (if (zerop n)      
      product      
      (! (1- n) (* product n)))) ]]></description>
<pubDate>Wed, 25 Aug 2010 04:04:47 GMT</pubDate>
<guid>http://snipplr.com/view/4534/large-factorials-in-lisp/</guid>
</item>
</channel>
</rss>