<?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: Sorting Algorithms: The Bubble Sort</title>
	<atom:link href="http://buffered.io/2008/08/14/sorting-algorithms-the-bubble-sort/feed/" rel="self" type="application/rss+xml" />
	<link>http://buffered.io/2008/08/14/sorting-algorithms-the-bubble-sort/</link>
	<description>What would OJ do?</description>
	<lastBuildDate>Wed, 17 Mar 2010 08:58:04 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: OJ</title>
		<link>http://buffered.io/2008/08/14/sorting-algorithms-the-bubble-sort/comment-page-1/#comment-1097</link>
		<dc:creator>OJ</dc:creator>
		<pubDate>Wed, 17 Sep 2008 19:45:18 +0000</pubDate>
		<guid isPermaLink="false">http://buffered.io/?p=478#comment-1097</guid>
		<description>@Bona: The short answer is: &lt;strong&gt;no&lt;/strong&gt;.

I&#039;ve described the algorithm in a fair bit of detail, and shown sample implementations. It&#039;s a fairly trivial matter to take the information in this article and extend it to sort lists and arrays of strings.

Do your own homework, you might learn something! :)</description>
		<content:encoded><![CDATA[<p>@Bona: The short answer is: <strong>no</strong>.</p>
<p>I&#8217;ve described the algorithm in a fair bit of detail, and shown sample implementations. It&#8217;s a fairly trivial matter to take the information in this article and extend it to sort lists and arrays of strings.</p>
<p>Do your own homework, you might learn something! <img src='http://buffered.io/wp-content/plugins/smilies-themer/Silk/emoticon_smile.png' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Bona</title>
		<link>http://buffered.io/2008/08/14/sorting-algorithms-the-bubble-sort/comment-page-1/#comment-1098</link>
		<dc:creator>Bona</dc:creator>
		<pubDate>Wed, 17 Sep 2008 11:12:30 +0000</pubDate>
		<guid isPermaLink="false">http://buffered.io/?p=478#comment-1098</guid>
		<description>Please hlep me write a C++ program that sorts person&#039;s name in desecnding order using bubble sorting algorithm.</description>
		<content:encoded><![CDATA[<p>Please hlep me write a C++ program that sorts person&#8217;s name in desecnding order using bubble sorting algorithm.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: OJ</title>
		<link>http://buffered.io/2008/08/14/sorting-algorithms-the-bubble-sort/comment-page-1/#comment-1093</link>
		<dc:creator>OJ</dc:creator>
		<pubDate>Sat, 16 Aug 2008 11:00:10 +0000</pubDate>
		<guid isPermaLink="false">http://buffered.io/?p=478#comment-1093</guid>
		<description>Another update, I&#039;ve added F# samples as well. Grab the latest from the repo if you&#039;re interested. They&#039;re very similar to Haskell.

Down the track I&#039;ll add an async sample to the F# code.</description>
		<content:encoded><![CDATA[<p>Another update, I&#8217;ve added F# samples as well. Grab the latest from the repo if you&#8217;re interested. They&#8217;re very similar to Haskell.</p>
<p>Down the track I&#8217;ll add an async sample to the F# code.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: OJ</title>
		<link>http://buffered.io/2008/08/14/sorting-algorithms-the-bubble-sort/comment-page-1/#comment-1096</link>
		<dc:creator>OJ</dc:creator>
		<pubDate>Fri, 15 Aug 2008 09:00:24 +0000</pubDate>
		<guid isPermaLink="false">http://buffered.io/?p=478#comment-1096</guid>
		<description>FYI, I&#039;ve just uploaded samples in Haskell. You can find them on the BitBucket repo. Cheers!</description>
		<content:encoded><![CDATA[<p>FYI, I&#8217;ve just uploaded samples in Haskell. You can find them on the BitBucket repo. Cheers!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: OJ</title>
		<link>http://buffered.io/2008/08/14/sorting-algorithms-the-bubble-sort/comment-page-1/#comment-1095</link>
		<dc:creator>OJ</dc:creator>
		<pubDate>Fri, 15 Aug 2008 08:58:49 +0000</pubDate>
		<guid isPermaLink="false">http://buffered.io/?p=478#comment-1095</guid>
		<description>@RobG: It&#039;s a good question. One that I asked myself prior to starting the series.

In the case of a simple algorithm like the Bubble Sort, the benefit of reading this page vs the Wikipedia entry is probably nothing. Will this remain the case for the other algorithms? No I don&#039;t think so.

Wikipedia articles, while helpful, tend to be written in a manner which makes it sound like the author is trying to sound smart. That might sound harsh, but that&#039;s how it feels to me. The entries attempt to be too formal, and use a bit too much jargon for my liking. Also, as you get to some of the more complicated algorithms, the entries on Wikipedia aren&#039;t easily grokked, or they&#039;re too high-level to really cover what&#039;s going on.

My goals:
&lt;ol&gt;
&lt;li&gt;To cover as many algorithms as I can in &lt;span style=&quot;text-decoration: underline;&quot;&gt;detail&lt;/span&gt; (Wikipedia is hit and miss in this regard).&lt;/li&gt;
&lt;li&gt;Avoid using jargon when it&#039;s not necessary and make it as clear and as readable as possible.&lt;/li&gt;
&lt;li&gt;Give working samples of code in multiple languages (both imperative and functional).&lt;/li&gt;
&lt;/ol&gt;On top of this, I am working on WPF-based visualiser (not sure if I&#039;ll make it an EXE or an XBAP) which will animate the process of each of these sorting algorithms. This will take a bit of time and probably won&#039;t get released until I&#039;ve covered a few algorithms.

So, with all that in mind, I want it to be a place where people can come and read about all the algorithms, and get full coverage, in laymans terms, with an interactive visualisation. No site that I have found so far has that, including Wikipedia.

Of course, if nobody reads this stuff it still doesn&#039;t matter. Because I will have learned a lot, and brushed up on my understanding of all these algorithms along the way. So I&#039;m still ahead :)

Cheers bud!</description>
		<content:encoded><![CDATA[<p>@RobG: It&#8217;s a good question. One that I asked myself prior to starting the series.</p>
<p>In the case of a simple algorithm like the Bubble Sort, the benefit of reading this page vs the Wikipedia entry is probably nothing. Will this remain the case for the other algorithms? No I don&#8217;t think so.</p>
<p>Wikipedia articles, while helpful, tend to be written in a manner which makes it sound like the author is trying to sound smart. That might sound harsh, but that&#8217;s how it feels to me. The entries attempt to be too formal, and use a bit too much jargon for my liking. Also, as you get to some of the more complicated algorithms, the entries on Wikipedia aren&#8217;t easily grokked, or they&#8217;re too high-level to really cover what&#8217;s going on.</p>
<p>My goals:</p>
<ol>
<li>To cover as many algorithms as I can in <span style="text-decoration: underline;">detail</span> (Wikipedia is hit and miss in this regard).</li>
<li>Avoid using jargon when it&#8217;s not necessary and make it as clear and as readable as possible.</li>
<li>Give working samples of code in multiple languages (both imperative and functional).</li>
</ol>
<p>On top of this, I am working on WPF-based visualiser (not sure if I&#8217;ll make it an EXE or an XBAP) which will animate the process of each of these sorting algorithms. This will take a bit of time and probably won&#8217;t get released until I&#8217;ve covered a few algorithms.</p>
<p>So, with all that in mind, I want it to be a place where people can come and read about all the algorithms, and get full coverage, in laymans terms, with an interactive visualisation. No site that I have found so far has that, including Wikipedia.</p>
<p>Of course, if nobody reads this stuff it still doesn&#8217;t matter. Because I will have learned a lot, and brushed up on my understanding of all these algorithms along the way. So I&#8217;m still ahead <img src='http://buffered.io/wp-content/plugins/smilies-themer/Silk/emoticon_smile.png' alt=':)' class='wp-smiley' /><br />
Cheers bud!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: RobG</title>
		<link>http://buffered.io/2008/08/14/sorting-algorithms-the-bubble-sort/comment-page-1/#comment-1094</link>
		<dc:creator>RobG</dc:creator>
		<pubDate>Fri, 15 Aug 2008 08:48:23 +0000</pubDate>
		<guid isPermaLink="false">http://buffered.io/?p=478#comment-1094</guid>
		<description>Hey OJ,

How is this any different from a really good Wikipedia entry on Bubblesort? In fact the entry there is pretty similar. I guess what I&#039;m asking is, why would anyone come here to find out about sorting rather than going to Wikipedia?

Given Wikipedia&#039;s popularity, how do you plan to differentiate your posts in this series from the general stuff already out there? I know it&#039;s probably quite tough to depict that thinking in such a simple sort, but I was wondering what your plans were on this early on?

Great read mate - flows nicely!
Cheers,
Rob</description>
		<content:encoded><![CDATA[<p>Hey OJ,</p>
<p>How is this any different from a really good Wikipedia entry on Bubblesort? In fact the entry there is pretty similar. I guess what I&#8217;m asking is, why would anyone come here to find out about sorting rather than going to Wikipedia?</p>
<p>Given Wikipedia&#8217;s popularity, how do you plan to differentiate your posts in this series from the general stuff already out there? I know it&#8217;s probably quite tough to depict that thinking in such a simple sort, but I was wondering what your plans were on this early on?</p>
<p>Great read mate &#8211; flows nicely!<br />
Cheers,<br />
Rob</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: OJ</title>
		<link>http://buffered.io/2008/08/14/sorting-algorithms-the-bubble-sort/comment-page-1/#comment-1092</link>
		<dc:creator>OJ</dc:creator>
		<pubDate>Thu, 14 Aug 2008 22:38:01 +0000</pubDate>
		<guid isPermaLink="false">http://buffered.io/?p=478#comment-1092</guid>
		<description>@Keef: This is interseting. It appears that some of the class tags for the spans that I was using for formatting have been stripped in the feed. I&#039;m not yet sure if it&#039;s Google Reader, or if the feed has been &quot;adjusted&quot;. I&#039;ll try and fix that up soon though. Cheers!</description>
		<content:encoded><![CDATA[<p>@Keef: This is interseting. It appears that some of the class tags for the spans that I was using for formatting have been stripped in the feed. I&#8217;m not yet sure if it&#8217;s Google Reader, or if the feed has been &#8220;adjusted&#8221;. I&#8217;ll try and fix that up soon though. Cheers!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: OJ</title>
		<link>http://buffered.io/2008/08/14/sorting-algorithms-the-bubble-sort/comment-page-1/#comment-1091</link>
		<dc:creator>OJ</dc:creator>
		<pubDate>Thu, 14 Aug 2008 21:10:57 +0000</pubDate>
		<guid isPermaLink="false">http://buffered.io/?p=478#comment-1091</guid>
		<description>@Keef: Hrm, bugger. I was trying to make it so that it would actually behave in the feed as well. I&#039;ll take a look. Cheers.

@gav: Thanks for the comments dude. I realise that most people will know this one, but it was low hanging fruit which I think people are happy to read about because it&#039;s a &quot;refresher&quot;. As time goes by the algorithms will get more interesting, and hence a lot harder to digest ;)</description>
		<content:encoded><![CDATA[<p>@Keef: Hrm, bugger. I was trying to make it so that it would actually behave in the feed as well. I&#8217;ll take a look. Cheers.</p>
<p>@gav: Thanks for the comments dude. I realise that most people will know this one, but it was low hanging fruit which I think people are happy to read about because it&#8217;s a &#8220;refresher&#8221;. As time goes by the algorithms will get more interesting, and hence a lot harder to digest <img src='http://buffered.io/wp-content/plugins/smilies-themer/Silk/emoticon_wink.png' alt=';)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: gav</title>
		<link>http://buffered.io/2008/08/14/sorting-algorithms-the-bubble-sort/comment-page-1/#comment-1090</link>
		<dc:creator>gav</dc:creator>
		<pubDate>Thu, 14 Aug 2008 16:53:32 +0000</pubDate>
		<guid isPermaLink="false">http://buffered.io/?p=478#comment-1090</guid>
		<description>Nice article OJ. Was interesting enough to read even though I (obviously!) already knew all that. 

Looking forward to the rest in the series.</description>
		<content:encoded><![CDATA[<p>Nice article OJ. Was interesting enough to read even though I (obviously!) already knew all that. </p>
<p>Looking forward to the rest in the series.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Keef</title>
		<link>http://buffered.io/2008/08/14/sorting-algorithms-the-bubble-sort/comment-page-1/#comment-1089</link>
		<dc:creator>Keef</dc:creator>
		<pubDate>Thu, 14 Aug 2008 10:51:57 +0000</pubDate>
		<guid isPermaLink="false">http://buffered.io/?p=478#comment-1089</guid>
		<description>Ah the hello world of algorithms!  Nice article!

On an unrelated note, I&#039;ve just noticed that not all the text colouring comes through on the feed.  The pre formatted code blocks are fine (though the grey box around them is missing), but the red and blue highlights in the sort run through are missing.</description>
		<content:encoded><![CDATA[<p>Ah the hello world of algorithms!  Nice article!</p>
<p>On an unrelated note, I&#8217;ve just noticed that not all the text colouring comes through on the feed.  The pre formatted code blocks are fine (though the grey box around them is missing), but the red and blue highlights in the sort run through are missing.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
