<?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: C Program to Print Fibonacci Series using Recursion	</title>
	<atom:link href="https://webrewrite.com/print-fibonacci-series-using-recursion/feed/" rel="self" type="application/rss+xml" />
	<link>https://webrewrite.com/print-fibonacci-series-using-recursion/</link>
	<description>Technology Blog Where You Find Programming Tips and Tricks</description>
	<lastBuildDate>Fri, 20 Jul 2018 16:11:31 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.0.7</generator>
	<item>
		<title>
		By: Aman Rustagi		</title>
		<link>https://webrewrite.com/print-fibonacci-series-using-recursion/#comment-785</link>

		<dc:creator><![CDATA[Aman Rustagi]]></dc:creator>
		<pubDate>Sun, 18 Sep 2016 07:34:00 +0000</pubDate>
		<guid isPermaLink="false">http://webrewrite.com/?p=1588#comment-785</guid>

					<description><![CDATA[fibonacci(N) = Nth term in fibonacci series
fibonacci(N) = fibonacci(N - 1) + fibonacci(N - 2);
whereas, fibonacci(0) = 0 and fibonacci(1) = 1
Fibonacci Series using Recursion]]></description>
			<content:encoded><![CDATA[<p>fibonacci(N) = Nth term in fibonacci series<br />
fibonacci(N) = fibonacci(N &#8211; 1) + fibonacci(N &#8211; 2);<br />
whereas, fibonacci(0) = 0 and fibonacci(1) = 1<br />
Fibonacci Series using Recursion</p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
