OLYMPIADS IN INFORMATICS, 2019, Vol. 13, pp. 31 - 39
© IOI, Vilnius University

ISSN 1822-7732

DOI: 10.15388/ioi.2019.03

On Implicit Means of Algorithmic Problem Solving

David GINAT

Tel-Aviv University, Science Education Department Ramat Aviv, Tel-Aviv, Israel 69978
e-mail: ginat@post.tau.ac.il

Abstract

Students of challenging algorithmics learn and utilize a variety of problem solving tools. The primary tools are data structures, generic algorithms, and algorithm design techniques. However, for solving challenging problems, one needs more than that. Many creative solutions involve implicit notions, whose creative employments yield elegant, concise, and efficient solutions. We elaborate on such notions and advocate their relevance as valuable means in one’s problem solving toolbox. We display our experience with students who lacked awareness of these notions, and illustrate the relevant role of three such notions – the notions of “candidate”, “complement”, and “invariance”.

Keywords:

algorithmic problem solving.


PDFTo preview full article text in PDF format click here

Get Free ReaderYou could obtain free Acrobat Reader from Adobe


Copyright © International Olympiad in Informatics, 2019
Vilnius University, 2019