Students in Computer Science class learnt the concept of recursion by solving the Tower of Hanoi puzzle. This classic problem demonstrates how recursion can simplify complex tasks by breaking them down into smaller, more manageable sub-problems. Students experienced how breaking a problem into smaller parts can lead to an elegant and efficient solution by doing this activity. They identified the number of steps and coded the recursive steps that solved the problem. By coding the recursive solution themselves, students gained a deeper understanding of recursion and improved their programming skills and learnt to think algorithmically.
