<?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: Programing on the Shoulders of Giants</title>
	<atom:link href="http://ideonexus.com/2008/04/25/programing-on-the-shoulders-of-giants/feed/" rel="self" type="application/rss+xml" />
	<link>http://ideonexus.com/2008/04/25/programing-on-the-shoulders-of-giants/</link>
	<description></description>
	<lastBuildDate>Fri, 05 Mar 2010 15:55:25 -0700</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Open Source Wedding Photography &#171; TGAW</title>
		<link>http://ideonexus.com/2008/04/25/programing-on-the-shoulders-of-giants/comment-page-1/#comment-1799</link>
		<dc:creator>Open Source Wedding Photography &#171; TGAW</dc:creator>
		<pubDate>Wed, 30 Apr 2008 05:02:57 +0000</pubDate>
		<guid isPermaLink="false">http://ideonexus.com/?p=1162#comment-1799</guid>
		<description>[...] was Deanna&#8217;s and my first run at this kind of task. I&#8217;m &#8220;open sourcing&#8221; our approach. For better or for worse, here&#8217;s what we [...]</description>
		<content:encoded><![CDATA[<p>[...] was Deanna&#8217;s and my first run at this kind of task. I&#8217;m &#8220;open sourcing&#8221; our approach. For better or for worse, here&#8217;s what we [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: sour Swinger</title>
		<link>http://ideonexus.com/2008/04/25/programing-on-the-shoulders-of-giants/comment-page-1/#comment-1760</link>
		<dc:creator>sour Swinger</dc:creator>
		<pubDate>Sat, 26 Apr 2008 01:49:41 +0000</pubDate>
		<guid isPermaLink="false">http://ideonexus.com/?p=1162#comment-1760</guid>
		<description>The benefit of open-source!  This reminds me of my algorithms class.  We had to write an O(n log n) sorting algorithm for alphabetizing text files per word.  Since I slept through class on the how to for quick sort, I ended up coding a merge sort.  The merge proved far easier to implement then the quick.  It also ended up offering comparable if not slightly better performance.</description>
		<content:encoded><![CDATA[<p>The benefit of open-source!  This reminds me of my algorithms class.  We had to write an O(n log n) sorting algorithm for alphabetizing text files per word.  Since I slept through class on the how to for quick sort, I ended up coding a merge sort.  The merge proved far easier to implement then the quick.  It also ended up offering comparable if not slightly better performance.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
