<?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: Bubble Sort is Never the Answer</title> <atom:link href="http://tinsology.net/2009/06/bubble-sort-is-never-the-answer/feed/" rel="self" type="application/rss+xml" /><link>http://tinsology.net/2009/06/bubble-sort-is-never-the-answer/</link> <description>Searching for the Right Questions</description> <lastBuildDate>Sun, 05 Feb 2012 10:13:23 +0000</lastBuildDate> <sy:updatePeriod>hourly</sy:updatePeriod> <sy:updateFrequency>1</sy:updateFrequency> <generator>http://wordpress.org/?v=3.3.1</generator> <item><title>By: Tobias Svensson</title><link>http://tinsology.net/2009/06/bubble-sort-is-never-the-answer/comment-page-1/#comment-1458</link> <dc:creator>Tobias Svensson</dc:creator> <pubDate>Sun, 07 Jun 2009 12:59:31 +0000</pubDate> <guid
isPermaLink="false">http://tinsology.net/?p=756#comment-1458</guid> <description>You should have mentioned, that bubble sort and insertion sort have the same worst case performance, but differ in comparisons and exchanges, so is is clearer why insertion sort actually performs better. While bubble sort has an average of n^2/2 for both, comparisons and exchanges, insertion sort uses about n^2/4 comparisons and n^2/8 exchanges.</description> <content:encoded><![CDATA[<p>You should have mentioned, that bubble sort and insertion sort have the same worst case performance, but differ in comparisons and exchanges, so is is clearer why insertion sort actually performs better. While bubble sort has an average of n^2/2 for both, comparisons and exchanges, insertion sort uses about n^2/4 comparisons and n^2/8 exchanges.</p> ]]></content:encoded> </item> </channel> </rss>
