<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Simple linear analysis of the performance of two algorithms.</title>
	<atom:link href="http://syntaxfree.wordpress.com/2007/05/04/lra/feed/" rel="self" type="application/rss+xml" />
	<link>http://syntaxfree.wordpress.com/2007/05/04/lra/</link>
	<description>Haskell programming journal</description>
	<lastBuildDate>Fri, 17 May 2013 21:48:47 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: how to get into columbia business school</title>
		<link>http://syntaxfree.wordpress.com/2007/05/04/lra/#comment-5801</link>
		<dc:creator><![CDATA[how to get into columbia business school]]></dc:creator>
		<pubDate>Thu, 02 May 2013 22:01:35 +0000</pubDate>
		<guid isPermaLink="false">http://syntaxfree.wordpress.com/2007/05/04/lra/#comment-5801</guid>
		<description><![CDATA[I leave a comment each time I appreciate a article on a site or if I have 
something to valuable to contribute to the discussion.
It&#039;s triggered by the passion displayed in the post I read. And on this article Simple linear analysis of the performance of two algorithms. &#124; Data.Syntaxfree. I was actually moved enough to post a comment :) I actually do have some questions for you if it&#039;s okay.
Could it be just me or do some of these responses appear 
as if they are coming from brain dead folks? :-P And, if you are 
posting at other social sites, I&#039;d like to keep up with anything new you have to post. Could you list all of all your community sites like your twitter feed, Facebook page or linkedin profile?]]></description>
		<content:encoded><![CDATA[<p>I leave a comment each time I appreciate a article on a site or if I have<br />
something to valuable to contribute to the discussion.<br />
It&#8217;s triggered by the passion displayed in the post I read. And on this article Simple linear analysis of the performance of two algorithms. | Data.Syntaxfree. I was actually moved enough to post a comment <img src='http://s0.wp.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' />  I actually do have some questions for you if it&#8217;s okay.<br />
Could it be just me or do some of these responses appear<br />
as if they are coming from brain dead folks? <img src='http://s2.wp.com/wp-includes/images/smilies/icon_razz.gif' alt=':-P' class='wp-smiley' />  And, if you are<br />
posting at other social sites, I&#8217;d like to keep up with anything new you have to post. Could you list all of all your community sites like your twitter feed, Facebook page or linkedin profile?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dylan Thurston</title>
		<link>http://syntaxfree.wordpress.com/2007/05/04/lra/#comment-990</link>
		<dc:creator><![CDATA[Dylan Thurston]]></dc:creator>
		<pubDate>Fri, 04 May 2007 22:31:22 +0000</pubDate>
		<guid isPermaLink="false">http://syntaxfree.wordpress.com/2007/05/04/lra/#comment-990</guid>
		<description><![CDATA[There are much faster ways of generating the list of divisors; it&#039;s far better to factor the number, and then trivially generate the list of divisors from the list of prime factors.  Even trial factorization, the stupidest prime factorization you could write, would beat this one, since as soon as you find _one_ divisor you can reduce the size of the problem...]]></description>
		<content:encoded><![CDATA[<p>There are much faster ways of generating the list of divisors; it&#8217;s far better to factor the number, and then trivially generate the list of divisors from the list of prime factors.  Even trial factorization, the stupidest prime factorization you could write, would beat this one, since as soon as you find _one_ divisor you can reduce the size of the problem&#8230;</p>
]]></content:encoded>
	</item>
</channel>
</rss>
