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.
|Number of pages||11|
|Journal||Olympiads in Informatics|
|State||Published - 2014|
|Event||International Conference Joint with the 26th International Olympiad in Informatics, IOI 2014 - Taipei, Taiwan, Province of China|
Duration: 13 Jul 2014 → 20 Jul 2014
- Problem representation
- Problem solving