<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Python Newbie Night vs. Recursion</title>
	<atom:link href="http://hacklab.to/archives/python-newbie-night-vs-recursion/feed/" rel="self" type="application/rss+xml" />
	<link>http://hacklab.to/archives/python-newbie-night-vs-recursion/</link>
	<description>Toronto&#039;s hacker collective</description>
	<lastBuildDate>Tue, 08 Jan 2013 03:45:52 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
	<item>
		<title>By: Scott Tsai</title>
		<link>http://hacklab.to/archives/python-newbie-night-vs-recursion/comment-page-1/#comment-72</link>
		<dc:creator>Scott Tsai</dc:creator>
		<pubDate>Wed, 25 Mar 2009 09:49:49 +0000</pubDate>
		<guid isPermaLink="false">http://hacklab.to/?p=281#comment-72</guid>
		<description>I usually translate the Scheme examples on this page into Python:
http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-11.html

In particular, the examples: &quot;factorial&quot;, &quot;fib&quot; and &quot;count_change&quot;. Maybe then add the tower of Hanoi.</description>
		<content:encoded><![CDATA[<p>I usually translate the Scheme examples on this page into Python:<br />
<a href="http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-11.html" rel="nofollow">http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-11.html</a></p>
<p>In particular, the examples: &#8220;factorial&#8221;, &#8220;fib&#8221; and &#8220;count_change&#8221;. Maybe then add the tower of Hanoi.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: lance</title>
		<link>http://hacklab.to/archives/python-newbie-night-vs-recursion/comment-page-1/#comment-38</link>
		<dc:creator>lance</dc:creator>
		<pubDate>Sun, 01 Mar 2009 00:52:05 +0000</pubDate>
		<guid isPermaLink="false">http://hacklab.to/?p=281#comment-38</guid>
		<description>Fibonacci. It&#039;s a great example because of the simplicity in the first implementation. It leads into recursion tree diagrams. You can explain how the stack works and why it&#039;s overflowing. Finally, you can explain what an accumulator is.</description>
		<content:encoded><![CDATA[<p>Fibonacci. It&#8217;s a great example because of the simplicity in the first implementation. It leads into recursion tree diagrams. You can explain how the stack works and why it&#8217;s overflowing. Finally, you can explain what an accumulator is.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: senthoor711</title>
		<link>http://hacklab.to/archives/python-newbie-night-vs-recursion/comment-page-1/#comment-37</link>
		<dc:creator>senthoor711</dc:creator>
		<pubDate>Sat, 28 Feb 2009 23:16:38 +0000</pubDate>
		<guid isPermaLink="false">http://hacklab.to/?p=281#comment-37</guid>
		<description>How about recursion in raytracing?</description>
		<content:encoded><![CDATA[<p>How about recursion in raytracing?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: maco</title>
		<link>http://hacklab.to/archives/python-newbie-night-vs-recursion/comment-page-1/#comment-35</link>
		<dc:creator>maco</dc:creator>
		<pubDate>Sun, 22 Feb 2009 23:11:38 +0000</pubDate>
		<guid isPermaLink="false">http://hacklab.to/?p=281#comment-35</guid>
		<description>Recursion (ri-kur-zhuh) noun
See: Recursion</description>
		<content:encoded><![CDATA[<p>Recursion (ri-kur-zhuh) noun<br />
See: Recursion</p>
]]></content:encoded>
	</item>
</channel>
</rss>
