<?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>Recursion on RonoITU</title>
    <link>https://ronoitu.neocities.org/tags/recursion/</link>
    <description>Recent content in Recursion on RonoITU</description>
    <generator>Hugo</generator>
    <language>en</language>
    <copyright>2025-2026 RonoITU</copyright>
    <lastBuildDate>Thu, 24 Jul 2025 16:59:00 +0200</lastBuildDate>
    <atom:link href="https://ronoitu.neocities.org/tags/recursion/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Recursive Functions in F# 2 - Two Dimensions</title>
      <link>https://ronoitu.neocities.org/algorithms/fp_recursion_2/</link>
      <pubDate>Thu, 24 Jul 2025 16:59:00 +0200</pubDate>
      <guid>https://ronoitu.neocities.org/algorithms/fp_recursion_2/</guid>
      <description>For many types of problems, two or more for-loops are nested to iterate over multiple dimensions. In this article, we look at how to do this recursively in F#.</description>
    </item>
    <item>
      <title>Recursive Functions in F# 1 - Basic Iterations</title>
      <link>https://ronoitu.neocities.org/algorithms/fp_recursion_1/</link>
      <pubDate>Sat, 12 Jul 2025 11:12:03 +0200</pubDate>
      <guid>https://ronoitu.neocities.org/algorithms/fp_recursion_1/</guid>
      <description>In this article, I demonstrate how to build a basic iterator using different recursive function patterns. This is the first of a series of articles for learning functional programming in F#.</description>
    </item>
  </channel>
</rss>
