<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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:slash="http://purl.org/rss/1.0/modules/slash/"
	
	xmlns:georss="http://www.georss.org/georss"
	xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#"
	>

<channel>
	<title>fibonacci &#8211; JSAlgorithm</title>
	<atom:link href="https://jsalgorithm.com/tag/fibonacci/feed/" rel="self" type="application/rss+xml" />
	<link>https://jsalgorithm.com</link>
	<description></description>
	<lastBuildDate>Tue, 12 May 2020 12:53:10 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=5.5.15</generator>
<site xmlns="com-wordpress:feed-additions:1">177240629</site>	<item>
		<title>Fibonacci (Recursion)</title>
		<link>https://jsalgorithm.com/2020/05/12/fibonacci-recursion/</link>
					<comments>https://jsalgorithm.com/2020/05/12/fibonacci-recursion/#respond</comments>
		
		<dc:creator><![CDATA[Ronald]]></dc:creator>
		<pubDate>Tue, 12 May 2020 12:53:10 +0000</pubDate>
				<category><![CDATA[Dynamic Programming]]></category>
		<category><![CDATA[Leetcode]]></category>
		<category><![CDATA[Recursion]]></category>
		<category><![CDATA[dynamic-programming]]></category>
		<category><![CDATA[fibonacci]]></category>
		<category><![CDATA[leetcode]]></category>
		<guid isPermaLink="false">http://50.19.13.106/?p=38</guid>

					<description><![CDATA[function fib(x) { let cache = {} function fibInternal(n) { if(n == 0) return 0; if(n &#60;= 2) return 1; if (cache[n]) return cache[n]; const result = fibInternal(n - 1) + fibInternal(n - 2); cache[n] = result; return result; } return fibInternal(x) }]]></description>
										<content:encoded><![CDATA[
<pre class="wp-block-preformatted">function fib(x) {
    let cache = {}
    function fibInternal(n) {
        if(n == 0) return 0;
        if(n &lt;= 2) return 1;
        if (cache[n]) return cache[n];

        const result = fibInternal(n - 1) + fibInternal(n - 2);
        cache[n] = result;
        return result;
    }

    return fibInternal(x)
}</pre>
]]></content:encoded>
					
					<wfw:commentRss>https://jsalgorithm.com/2020/05/12/fibonacci-recursion/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">38</post-id>	</item>
		<item>
		<title>Fibonacci (Iterative)</title>
		<link>https://jsalgorithm.com/2020/05/12/fibonacci-iterative/</link>
					<comments>https://jsalgorithm.com/2020/05/12/fibonacci-iterative/#respond</comments>
		
		<dc:creator><![CDATA[Ronald]]></dc:creator>
		<pubDate>Tue, 12 May 2020 12:47:29 +0000</pubDate>
				<category><![CDATA[Leetcode]]></category>
		<category><![CDATA[fibonacci]]></category>
		<category><![CDATA[loop]]></category>
		<guid isPermaLink="false">http://50.19.13.106/?p=36</guid>

					<description><![CDATA[function fib(n) { if(n === 0) return 0; if(n &#60;= 2) return 1; let x = 1, y = 2; for(let i = 3; i &#60; n; i++) { let oldX = x; x = y; y = y + oldX; /*?.*/ } return y; }]]></description>
										<content:encoded><![CDATA[
<pre class="wp-block-preformatted">function fib(n) {<br>    if(n === 0) return 0;<br>    if(n &lt;= 2) return 1;<br><br>    let x = 1, y = 2;<br>    for(let i = 3; i &lt; n; i++) {<br>        let oldX = x;<br>        x = y;<br>        y = y + oldX;  /*?.*/<br>    }<br><br>    return y; <br>}</pre>
]]></content:encoded>
					
					<wfw:commentRss>https://jsalgorithm.com/2020/05/12/fibonacci-iterative/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">36</post-id>	</item>
	</channel>
</rss>
