http://coderwiki.org/index.php?action=history&feed=atom&title=Recursion 2026-05-19T06:26:03Z Revision history for this page on the wiki MediaWiki 1.44.0 http://coderwiki.org/index.php?title=Recursion&diff=74&oldid=prev 2025-08-12T11:53:56Z

<p>new: info, examples (pseudocode, c recursion, c iteration)</p> <p><b>New page</b></p><div>&#039;&#039;&#039;Recursion&#039;&#039;&#039; is the process of &#039;&#039;&#039;repeating code&#039;&#039;&#039; by calling a [[subroutine]] from within that same [[subroutine]].<br /> <br /> == Pseudocode example ==<br /> function factorial(n: int) -&gt; int<br /> if n &lt;= 1 then<br /> return n<br /> endif<br /> return n * factorial(n - 1)<br /> endfunction<br /> <br /> == [[C]] example ==<br /> The same code in the &#039;&#039;&#039;C&#039;&#039;&#039; [[programming language]] would look like this:&lt;syntaxhighlight lang=&quot;c&quot; line=&quot;1&quot;&gt;<br /> int factorial(int n) {<br /> if (n == 1) { <br /> return n;<br /> }<br /> return n * factorial(n - 1);<br /> }<br /> &lt;/syntaxhighlight&gt;<br /> <br /> == The same [[C]] code with [[iteration]] ==<br /> The alternative to using &#039;&#039;&#039;recursion&#039;&#039;&#039; would be to use &#039;&#039;&#039;[[iteration]]&#039;&#039;&#039;. This isn&#039;t always the best option, so sometimes iteration is a better choice:&lt;syntaxhighlight lang=&quot;c&quot; line=&quot;1&quot;&gt;<br /> int factorial(int n) {<br /> int result = n;<br /> for (int i = n-1; i &gt; 1; i--) {<br /> result *= i;<br /> }<br /> return result;<br /> }<br /> &lt;/syntaxhighlight&gt;</div>

Dylan