<?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>Recursive Algorithm in C++</title><link>http://blogs.msdn.com/xiangfan/archive/2009/05/23/recursive-algorithm-in-c.aspx</link><description>Many recursive algorithms have initial parameters. For example, Fibonacci Number is defined as: Fn = Fn-1 + Fn-2, with F1 = F2 = 1. By giving different values to F1 and F2, we can generate different sequence of numbers. 1. If we implement the algorithm</description><dc:language>en-US</dc:language><generator>CommunityServer 2.1 SP1 (Build: 61025.2)</generator><item><title>Recursive Algorithm in C++ | ASP NET Hosting</title><link>http://blogs.msdn.com/xiangfan/archive/2009/05/23/recursive-algorithm-in-c.aspx#9637432</link><pubDate>Sat, 23 May 2009 17:40:07 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9637432</guid><dc:creator>Recursive Algorithm in C++ | ASP NET Hosting</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://asp-net-hosting.simplynetdev.com/recursive-algorithm-in-c/"&gt;http://asp-net-hosting.simplynetdev.com/recursive-algorithm-in-c/&lt;/a&gt;&lt;/p&gt;
</description></item></channel></rss>