Treffer: On Inductive Progress in Algorithmic Problem Solving.

Induction is known, first and foremost, to mathematics and computer science students as an essential means for proving theorems. But induction is much more than that. Induction is also a core heuristic in the process of problem solving. In algorithmics, a problem solver should seek gradual observations of patterns of the problem at hand, and then capitalize on them in devising an algorithmic solution. In this paper we elaborate on the heuristic of inductive progress during algorithmic problem solving. We demonstrate its essential role with three different examples. Such an elaboration may enhance the awareness of tutors and students to components of the gradual process of problem solving. [ABSTRACT FROM AUTHOR]

Copyright of Olympiads in Informatics is the property of Vilnius University, Institute of Mathematics & Informatics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)