<?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: Escape from Zurg</title>
	<atom:link href="http://lojic.com/blog/2007/09/10/escape-from-zurg/feed/" rel="self" type="application/rss+xml" />
	<link>http://lojic.com/blog/2007/09/10/escape-from-zurg/</link>
	<description></description>
	<lastBuildDate>Sun, 25 Dec 2011 09:28:24 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Scott Moonen</title>
		<link>http://lojic.com/blog/2007/09/10/escape-from-zurg/comment-page-1/#comment-6389</link>
		<dc:creator>Scott Moonen</dc:creator>
		<pubDate>Sat, 08 Aug 2009 19:36:15 +0000</pubDate>
		<guid isPermaLink="false">http://lojic.com/blog/2007/09/10/escape-from-zurg/#comment-6389</guid>
		<description>Brian, I gave this a try in Clojure.  You can see my solution over here: http://scott.andstuff.org/ClojureSpikes.</description>
		<content:encoded><![CDATA[<p>Brian, I gave this a try in Clojure.  You can see my solution over here: <a href="http://scott.andstuff.org/ClojureSpikes." rel="nofollow">http://scott.andstuff.org/ClojureSpikes.</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Colin Jones</title>
		<link>http://lojic.com/blog/2007/09/10/escape-from-zurg/comment-page-1/#comment-82</link>
		<dc:creator>Colin Jones</dc:creator>
		<pubDate>Fri, 25 Jul 2008 18:13:53 +0000</pubDate>
		<guid isPermaLink="false">http://lojic.com/blog/2007/09/10/escape-from-zurg/#comment-82</guid>
		<description>Thanks!  I found this on Google searching for a Ruby combinations algorithm (it&#039;s built into the Array class on Ruby 1.8.7, but I&#039;m limited to Ruby 1.8.6).</description>
		<content:encoded><![CDATA[<p>Thanks!  I found this on Google searching for a Ruby combinations algorithm (it&#8217;s built into the Array class on Ruby 1.8.7, but I&#8217;m limited to Ruby 1.8.6).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Brian Adkins</title>
		<link>http://lojic.com/blog/2007/09/10/escape-from-zurg/comment-page-1/#comment-81</link>
		<dc:creator>Brian Adkins</dc:creator>
		<pubDate>Tue, 11 Sep 2007 01:11:40 +0000</pubDate>
		<guid isPermaLink="false">http://lojic.com/blog/2007/09/10/escape-from-zurg/#comment-81</guid>
		<description>It looks like the more functional approach has side benefits. I timed the op&#039;s code and mine, and mine took ~32s vs. ~116 for the op&#039;s. I don&#039;t have time to analyze the difference, but I posted a note on comp.lang.ruby with profile output in case anyone feels like analyzing it.</description>
		<content:encoded><![CDATA[<p>It looks like the more functional approach has side benefits. I timed the op&#8217;s code and mine, and mine took ~32s vs. ~116 for the op&#8217;s. I don&#8217;t have time to analyze the difference, but I posted a note on comp.lang.ruby with profile output in case anyone feels like analyzing it.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

