<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Recursive on mellowd.co.uk</title>
    <link>https://mellowd.co.uk/tags/recursive/</link>
    <description>Recent content in Recursive on mellowd.co.uk</description>
    <generator>Hugo</generator>
    <language>en-gb</language>
    <lastBuildDate>Mon, 20 Apr 2015 17:50:24 +0000</lastBuildDate>
    <atom:link href="https://mellowd.co.uk/tags/recursive/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Visualising recursive functions</title>
      <link>https://mellowd.co.uk/post/visualising-recursive-functions/</link>
      <pubDate>Mon, 20 Apr 2015 17:50:24 +0000</pubDate>
      <guid>https://mellowd.co.uk/post/visualising-recursive-functions/</guid>
      <description>&lt;p&gt;I’ve been doing a lot of coding practise, and recursive functions are one of those things that’s easier to visualise than think about.&lt;/p&gt;
&lt;p&gt;At it’s heart, a recursive function is one that calls itself in over and over again until a result is found. At first that doesn’t make sense so let’s look at an example.&lt;/p&gt;
&lt;h2 id=&#34;factorial&#34;&gt;Factorial&lt;/h2&gt;
&lt;p&gt;The factorial of a number is the product off all numbers from that number down to 1. Two examples follow:&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
