<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>recursion &#8211; Alan Richmond</title>
	<atom:link href="https://tuxar.uk/tag/recursion/feed/" rel="self" type="application/rss+xml" />
	<link>https://tuxar.uk</link>
	<description>Scientific systems programmer (ex NASA, ESA/ESO, Hubble), web developer, online retailer (retired)</description>
	<lastBuildDate>Fri, 03 Jul 2015 11:29:32 +0000</lastBuildDate>
	<language>en-GB</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	

<image>
	<url>https://tuxar.uk/wp-content/uploads/2016/01/AlanRichmond-150x150.jpg</url>
	<title>recursion &#8211; Alan Richmond</title>
	<link>https://tuxar.uk</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>Animated Tower of Hanoi</title>
		<link>https://tuxar.uk/animated-tower-of-hanoi/</link>
					<comments>https://tuxar.uk/animated-tower-of-hanoi/#respond</comments>
		
		<dc:creator><![CDATA[Alan]]></dc:creator>
		<pubDate>Fri, 03 Jul 2015 11:29:32 +0000</pubDate>
				<category><![CDATA[Intermediate]]></category>
		<category><![CDATA[color]]></category>
		<category><![CDATA[graphics]]></category>
		<category><![CDATA[pygame]]></category>
		<category><![CDATA[recursion]]></category>
		<guid isPermaLink="false">http://python3.codes/?p=499</guid>

					<description><![CDATA[The Tower of Hanoi is a classic problem that lends itself well to a recursive solution. The story involves some... <span class="gridview-grid-post-read-more"><a href="https://tuxar.uk/animated-tower-of-hanoi/">read more<span class="gridview-sr-only"> Animated Tower of Hanoi</span></a></span>]]></description>
		
					<wfw:commentRss>https://tuxar.uk/animated-tower-of-hanoi/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Drawing Fractals with Lindenmayer Systems</title>
		<link>https://tuxar.uk/drawing-fractals-with-lindenmayer-systems/</link>
					<comments>https://tuxar.uk/drawing-fractals-with-lindenmayer-systems/#comments</comments>
		
		<dc:creator><![CDATA[Alan]]></dc:creator>
		<pubDate>Wed, 17 Jun 2015 12:54:13 +0000</pubDate>
				<category><![CDATA[Fractals]]></category>
		<category><![CDATA[Intermediate]]></category>
		<category><![CDATA[Turtle]]></category>
		<category><![CDATA[fractal]]></category>
		<category><![CDATA[function]]></category>
		<category><![CDATA[libraries]]></category>
		<category><![CDATA[recursion]]></category>
		<category><![CDATA[simulation]]></category>
		<guid isPermaLink="false">http://python3.codes/?p=418</guid>

					<description><![CDATA[Lindenmayer systems, or L-systems, provide a very powerful way to construct fractals. Lindenmayer used L-systems to describe the behaviour of... <span class="gridview-grid-post-read-more"><a href="https://tuxar.uk/drawing-fractals-with-lindenmayer-systems/">read more<span class="gridview-sr-only"> Drawing Fractals with Lindenmayer Systems</span></a></span>]]></description>
		
					<wfw:commentRss>https://tuxar.uk/drawing-fractals-with-lindenmayer-systems/feed/</wfw:commentRss>
			<slash:comments>1</slash:comments>
		
		
			</item>
		<item>
		<title>Binary Search</title>
		<link>https://tuxar.uk/binary-search/</link>
					<comments>https://tuxar.uk/binary-search/#comments</comments>
		
		<dc:creator><![CDATA[Alan]]></dc:creator>
		<pubDate>Mon, 27 Apr 2015 20:16:31 +0000</pubDate>
				<category><![CDATA[Basic]]></category>
		<category><![CDATA[Numbers]]></category>
		<category><![CDATA[def]]></category>
		<category><![CDATA[function]]></category>
		<category><![CDATA[list]]></category>
		<category><![CDATA[print]]></category>
		<category><![CDATA[random]]></category>
		<category><![CDATA[recursion]]></category>
		<guid isPermaLink="false">http://python3.codes/?p=108</guid>

					<description><![CDATA[Binary Search is one of the most fundamental computer algorithms. Given an ordered list of some data (names, numbers, &#8230;)... <span class="gridview-grid-post-read-more"><a href="https://tuxar.uk/binary-search/">read more<span class="gridview-sr-only"> Binary Search</span></a></span>]]></description>
		
					<wfw:commentRss>https://tuxar.uk/binary-search/feed/</wfw:commentRss>
			<slash:comments>1</slash:comments>
		
		
			</item>
		<item>
		<title>Sierpinski Triangle, drawn by a Turtle</title>
		<link>https://tuxar.uk/sierpinski-triangle-drawn-by-a-turtle/</link>
					<comments>https://tuxar.uk/sierpinski-triangle-drawn-by-a-turtle/#respond</comments>
		
		<dc:creator><![CDATA[Alan]]></dc:creator>
		<pubDate>Sat, 18 Apr 2015 14:40:16 +0000</pubDate>
				<category><![CDATA[Basic]]></category>
		<category><![CDATA[Turtle]]></category>
		<category><![CDATA[fractal]]></category>
		<category><![CDATA[libraries]]></category>
		<category><![CDATA[recursion]]></category>
		<category><![CDATA[turtle]]></category>
		<guid isPermaLink="false">http://python3.codes/?p=67</guid>

					<description><![CDATA[This is a classic fractal drawn with a recursion algorithm and Turtle graphics. The Sierpinski Triangle&#8217;s sides are bisected and... <span class="gridview-grid-post-read-more"><a href="https://tuxar.uk/sierpinski-triangle-drawn-by-a-turtle/">read more<span class="gridview-sr-only"> Sierpinski Triangle, drawn by a Turtle</span></a></span>]]></description>
		
					<wfw:commentRss>https://tuxar.uk/sierpinski-triangle-drawn-by-a-turtle/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Fractal Tree</title>
		<link>https://tuxar.uk/fractal-tree/</link>
					<comments>https://tuxar.uk/fractal-tree/#comments</comments>
		
		<dc:creator><![CDATA[Alan]]></dc:creator>
		<pubDate>Fri, 17 Apr 2015 14:28:33 +0000</pubDate>
				<category><![CDATA[Fractals]]></category>
		<category><![CDATA[Intermediate]]></category>
		<category><![CDATA[color]]></category>
		<category><![CDATA[colorsys]]></category>
		<category><![CDATA[cos]]></category>
		<category><![CDATA[events]]></category>
		<category><![CDATA[fractal]]></category>
		<category><![CDATA[HSV]]></category>
		<category><![CDATA[math]]></category>
		<category><![CDATA[pillow]]></category>
		<category><![CDATA[recursion]]></category>
		<category><![CDATA[RGB]]></category>
		<category><![CDATA[sin]]></category>
		<guid isPermaLink="false">http://python3.codes/?p=49</guid>

					<description><![CDATA[This program draws a &#8216;tree&#8217; by drawing a trunk (initially; later it&#8217;s a branch) and appending a tree, recursively. Uses... <span class="gridview-grid-post-read-more"><a href="https://tuxar.uk/fractal-tree/">read more<span class="gridview-sr-only"> Fractal Tree</span></a></span>]]></description>
		
					<wfw:commentRss>https://tuxar.uk/fractal-tree/feed/</wfw:commentRss>
			<slash:comments>1</slash:comments>
		
		
			</item>
	</channel>
</rss>
