<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Recursion on AI VOID</title><link>https://ai-blog.noorshomelab.dev/tags/recursion/</link><description>Recent content in Recursion on AI VOID</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 16 Feb 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://ai-blog.noorshomelab.dev/tags/recursion/index.xml" rel="self" type="application/rss+xml"/><item><title>Chapter 6: The Art of Repetition: Recursion and Iteration</title><link>https://ai-blog.noorshomelab.dev/dsa-typescript-mastery-2026/recursion-iteration/</link><pubDate>Mon, 16 Feb 2026 00:00:00 +0000</pubDate><guid>https://ai-blog.noorshomelab.dev/dsa-typescript-mastery-2026/recursion-iteration/</guid><description>&lt;h2 id="chapter-6-the-art-of-repetition-recursion-and-iteration"&gt;Chapter 6: The Art of Repetition: Recursion and Iteration&lt;/h2&gt;
&lt;p&gt;Welcome to Chapter 6! So far, you&amp;rsquo;ve mastered the fundamentals of setting up your TypeScript development environment and understanding how to analyze the efficiency of your code with Big-O notation. Now, it&amp;rsquo;s time to delve into two incredibly powerful and fundamental programming paradigms that allow us to tackle repetitive tasks: &lt;strong&gt;iteration&lt;/strong&gt; and &lt;strong&gt;recursion&lt;/strong&gt;.&lt;/p&gt;
&lt;p&gt;These concepts are the bread and butter of solving complex problems in Data Structures and Algorithms (DSA). Whether you&amp;rsquo;re processing lists, navigating trees, or searching through graphs, you&amp;rsquo;ll find yourself reaching for either an iterative loop or a recursive function. By the end of this chapter, you&amp;rsquo;ll not only understand how both work but also when and why to choose one over the other, empowering you to write more elegant and efficient TypeScript code.&lt;/p&gt;</description></item></channel></rss>