Teaching Design of Algorithms in High Schools by Constructive Induction

Abstract

The design of algorithms is one of the hardest topics of high school computer science. This is mainly due to the universality of algorithms as solution methods that guarantee the calculation of a correct solution for potentially infinitely many instances of an algorithmic problem. The goal of this paper is to present a comprehensible and robust algorithms design strategy called “constructive induction” that enables high school students to solve a large variety of algorithmic problems. In general, this strengthens learners in problem solving and their ability to use and develop abstract representations.