Skip to content
Recursive Problem Solving
Computing · JC 2 · Advanced Programming Paradigms · Semester 1

Recursive Problem Solving

Mastering the divide and conquer approach to solve complex mathematical and computational problems.

MOE Syllabus OutcomesMOE: Algorithms and Data Structures - JC2

About This Topic

Mastering the divide and conquer approach to solve complex mathematical and computational problems.

Key Questions

  1. When does a recursive solution become less efficient than an iterative one?
  2. How do we ensure a recursive function always reaches a base case?
  3. How can the Tower of Hanoi problem be decomposed using recursion?

Active Learning Ideas

See all activities

Activities & Teaching Strategies

See all activities