On inductive progress in algorithmic problem solving

David Ginat*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

3 Scopus citations


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.

Original languageEnglish
Pages (from-to)81-91
Number of pages11
JournalOlympiads in Informatics
StatePublished - 2014
EventInternational Conference Joint with the 26th International Olympiad in Informatics, IOI 2014 - Taipei, Taiwan, Province of China
Duration: 13 Jul 201420 Jul 2014


  • Induction
  • Problem representation
  • Problem solving


Dive into the research topics of 'On inductive progress in algorithmic problem solving'. Together they form a unique fingerprint.

Cite this