<?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: Recursive Fibonacci with F#</title>
	<atom:link href="http://www.pvle.be/2009/07/recursive-fibonacci-with-f/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.pvle.be/2009/07/recursive-fibonacci-with-f/</link>
	<description>I'm not that good but I'm not that bad</description>
	<lastBuildDate>Wed, 28 Dec 2011 22:14:01 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1.2</generator>
	<item>
		<title>By: Anhar</title>
		<link>http://www.pvle.be/2009/07/recursive-fibonacci-with-f/comment-page-1/#comment-1225</link>
		<dc:creator>Anhar</dc:creator>
		<pubDate>Mon, 03 Oct 2011 20:43:46 +0000</pubDate>
		<guid isPermaLink="false">http://www.pvle.be/2009/07/recursive-fibonacci-with-f/#comment-1225</guid>
		<description>A cheeky engineer may use an approximate method, and calculate it in constant time :)

function fib(int n)
{
   return Maths.round((Maths.pow(1.61,n)/2.23)+0.5));
}

of course this is widely inaccurate many cases. But us lazy engineers its &quot;meh, close enough&quot; :D</description>
		<content:encoded><![CDATA[<p>A cheeky engineer may use an approximate method, and calculate it in constant time <img src='http://www.pvle.be/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
<p>function fib(int n)<br />
{<br />
   return Maths.round((Maths.pow(1.61,n)/2.23)+0.5));<br />
}</p>
<p>of course this is widely inaccurate many cases. But us lazy engineers its &#8220;meh, close enough&#8221; <img src='http://www.pvle.be/wp-includes/images/smilies/icon_biggrin.gif' alt=':D' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
</channel>
</rss>

