Slide 1: Title
Muskan: Good morning everyone, I am Muskan.
Nitisha: And I am Nitisha. Today we present Designing Algorithms using Recursing Downward.
Slide 2: Introduction (Interactive)
Muskan: Before we start — who has heard of recursion?
Nitisha: Great! Today we’ll make it easy to understand.
Slide 3: Recursing Downward
Muskan: If I give you a big problem, how do you solve it?
Nitisha: By breaking it into smaller parts — that is recursing downward.
Slide 4: Key Characteristics
Muskan: Problem size decreases at each step.
Nitisha: Function calls itself and needs a base case.
Slide 5: Algorithm Design
Muskan: Define the problem and break it down.
Nitisha: Identify base case and combine results.
Slide 6: Factorial (Interactive)
Muskan: What is 4 factorial?
Nitisha: It is 4 × 3 × 2 × 1 = 24.
Slide 7: Code
Muskan: If n is 0 return 1.
Nitisha: Otherwise call function with n-1.
Slide 8: Working
Muskan: Let’s solve factorial of 3 together.
Nitisha: 3 × 2 × 1 = 6.
Slide 9: Flow
Muskan: Recursion goes downward first.
Nitisha: Then returns upward after base case.
Slide 10: Binary Search
Muskan: If we divide problem again and again, what happens?
Nitisha: It becomes easier and faster.
Slide 11: Applications
Muskan: Used in sorting and file systems.
Nitisha: Also used in trees and AI.
Slide 12: Advantages
Muskan: Simple and easy.
Nitisha: Useful for complex problems.
Slide 13: Disadvantages
Muskan: Uses more memory.
Nitisha: Can be slow.
Slide 14: Important Note
Muskan: What happens if we forget base case?
Nitisha: Infinite loop and crash.
Slide 15: Conclusion
Muskan: Recursing downward simplifies problems.
Nitisha: It is powerful but must be used carefully.
Slide 16: Thank You
Muskan: Thank you everyone.
Nitisha: Any questions?