Resumen de Problem Generalization for Designing Recursive Algorithms

Diana Borrego Núñez , Irene Barba Rodríguez , José Miguel Toro Bonilla , Carmelo del Valle Sevillano

• This paper focuses on the difficulty for university students to acquire, within computational thinking, the skills to solve certain problems through recursion. The acquisition of this type of reasoning is essential to understand the different problem solving techniques that are based on recursive algorithms, such as divide and conquer or dynamic programming. Therefore, first, the generalizationof problems is proposed as a strategy for designing recursive algorithms. As a second step, that generalization is formalized through a specification sheet that contains different fields that correspond to the characteristics that are relevant to solve a problem recursively.