<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[Recursion]]></title><description><![CDATA[Recursion]]></description><link>https://recursion1o1.hashnode.dev</link><generator>RSS for Node</generator><lastBuildDate>Mon, 31 Aug 2026 15:17:29 GMT</lastBuildDate><atom:link href="https://recursion1o1.hashnode.dev/rss.xml" rel="self" type="application/rss+xml"/><language><![CDATA[en]]></language><ttl>60</ttl><item><title><![CDATA[Recursion]]></title><description><![CDATA[Definition
It is the process in which function calls itself directly or indirectly.
All recursive algorithms must have the following conditions:
→ Base Case ( when to stop )
→ Recursive case ( breaking into smaller instance and calling the function a...]]></description><link>https://recursion1o1.hashnode.dev/recursion</link><guid isPermaLink="true">https://recursion1o1.hashnode.dev/recursion</guid><dc:creator><![CDATA[Lalit Rajbanshi]]></dc:creator><pubDate>Mon, 13 Jan 2025 01:28:29 GMT</pubDate><content:encoded><![CDATA[<h2 id="heading-definition">Definition</h2>
<p>It is the process in which function calls itself directly or indirectly.</p>
<h3 id="heading-all-recursive-algorithms-must-have-the-following-conditions">All recursive algorithms must have the following conditions:</h3>
<p>→ Base Case ( when to stop )</p>
<p>→ Recursive case ( breaking into smaller instance and calling the function again )</p>
]]></content:encoded></item></channel></rss>