Why Recursion Exists and What Loops Cannot Express Cleanly in DSA Typescript - See It Work

Why Recursion Exists and What Loops Cannot Express Cleanly

📖 Scenario: Imagine you have a set of nested boxes, where each box can contain another box inside it, and so on. You want to find the smallest box inside all these nested boxes.This is a real-world example where simple loops struggle to express the problem clearly, but recursion shines by naturally handling the nested structure.

🎯 Goal: You will build a recursive function in TypeScript that finds the smallest number inside a nested structure of boxes. Each box is represented as an object that either holds a number or another box.This project will show why recursion is useful and how it can express problems that loops cannot handle cleanly.

📋 What You'll Learn

Create a nested box structure using objects with exact values

Add a helper variable to track the smallest number found

Write a recursive function called findSmallestBox that finds the smallest number inside nested boxes

Print the smallest number found using console.log

💡 Why This Matters

🌍 Real World

Nested data structures appear in file systems, organizational charts, and JSON data. Recursion helps process these naturally.

💼 Career

Understanding recursion is essential for software developers, especially when working with trees, graphs, and nested data formats.

1

Create the nested box structure

Create a variable called nestedBoxes that represents nested boxes exactly as follows: the outer box contains another box, which contains another box, which finally contains the number 5. Use objects with the property box to nest boxes.

DSA Typescript

# Your code here

Hint

Use objects with a box property to nest boxes inside each other.

2

Add a helper variable to track smallest number

Create a variable called smallest and set it to Infinity to start tracking the smallest number found inside the boxes.

DSA Typescript

const nestedBoxes = { box: { box: { box: 5 } } };
# Your code here

Hint

Use let smallest = Infinity; to start with the largest possible number.

3

Write the recursive function to find the smallest number

Write a recursive function called findSmallestBox that takes a parameter box. If box is a number, update smallest if it is smaller. If box is an object with a box property, call findSmallestBox recursively on box.box.

DSA Typescript

const nestedBoxes = { box: { box: { box: 5 } } };
let smallest = Infinity;
# Your code here

Hint

Use typeof to check if box is a number or an object, then recurse accordingly.

4

Call the function and print the smallest number

Call findSmallestBox with nestedBoxes as argument. Then print the value of smallest using console.log(smallest).

DSA Typescript

const nestedBoxes = { box: { box: { box: 5 } } };
let smallest = Infinity;

function findSmallestBox(box: any): void {
    if (typeof box === 'number') {
        if (box < smallest) {
            smallest = box;
        }
    } else if (typeof box === 'object' && box.box !== undefined) {
        findSmallestBox(box.box);
    }
}
# Your code here

Hint

Call the recursive function with nestedBoxes and print smallest.