<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Some Assembly Required &#187; Algorithms</title>
	<atom:link href="http://assemblyrequired.crashworks.org/category/programming/algorithms-programming/feed/" rel="self" type="application/rss+xml" />
	<link>http://assemblyrequired.crashworks.org</link>
	<description>Technical Notes On Game Development</description>
	<lastBuildDate>Wed, 04 Nov 2009 09:52:17 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Sorting Algorithms, Animated</title>
		<link>http://assemblyrequired.crashworks.org/2008/10/30/sorting-algorithms-animated/</link>
		<comments>http://assemblyrequired.crashworks.org/2008/10/30/sorting-algorithms-animated/#comments</comments>
		<pubDate>Thu, 30 Oct 2008 01:20:04 +0000</pubDate>
		<dc:creator>Elan</dc:creator>
				<category><![CDATA[Algorithms]]></category>

		<guid isPermaLink="false">http://assemblyrequired.crashworks.org/?p=25</guid>
		<description><![CDATA[David R. Martin of Boston College made this great webpage demonstrating eight sorting algorithms and their performance under best-case, worst-case, and average-case conditions. It&#8217;s a clever, elegant way to show how there is no such thing as &#8220;one best sorting algorithm&#8221;, but that each has its own advantages and disadvantages depending on the expected data and [...]]]></description>
			<content:encoded><![CDATA[<p>David R. Martin of Boston College made <a href="http://vision.bc.edu/~dmartin/teaching/sorting/anim-html/all.html">this great webpage demonstrating eight sorting algorithms</a> and their performance under best-case, worst-case, and average-case conditions. It&#8217;s a clever, elegant way to show how there is no such thing as &#8220;one best sorting algorithm&#8221;, but that each has its own advantages and disadvantages depending on the expected data and space available. </p>
<p style="text-align: center; "> </p>
<p><a style="text-decoration: none;" title="Animated Sorting Algorithms" rel="http://vision.bc.edu/~dmartin/teaching/sorting/anim-html/all.html" href="http://assemblyrequired.crashworks.org/wp-content/uploads/2008/10/sortingalgs.png"><img class="size-full wp-image-24 aligncenter" title="Quick Sort demonstration" src="http://assemblyrequired.crashworks.org/wp-content/uploads/2008/10/sortingalgs.png" alt="Quick Sort demonstration" width="500" height="147" /></a></p>
<p>And, it&#8217;s kind of mesmerizing to see the little bars dancing busily back and forth as the algorithm does its thing. You can even race all the different algorithms against each other.</p>
]]></content:encoded>
			<wfw:commentRss>http://assemblyrequired.crashworks.org/2008/10/30/sorting-algorithms-animated/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
