<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Big O Notation - just how bad is that algorithm?</title><link>http://blogs.msdn.com/alfredth/archive/2006/08/24/717085.aspx</link><description>Someone sent me an email the other day looking for information to help him understand Big O notation. Big O notation is used to compare the efficiency of algorithms. If you teach Advanced Placement Computer Science (APCS) then this is something you have</description><dc:language>en-US</dc:language><generator>CommunityServer 2.1 SP1 (Build: 61025.2)</generator><item><title>Interesting Finds: August 24, 2006</title><link>http://blogs.msdn.com/alfredth/archive/2006/08/24/717085.aspx#720062</link><pubDate>Fri, 25 Aug 2006 05:35:11 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:720062</guid><dc:creator>Jason Haley</dc:creator><description /></item></channel></rss>