Kátai, Zoltán2024-09-042024-09-042005-12-01Teaching Mathematics and Computer Science, Vol. 3 No. 2 (2005) , 221-2401589-7389https://hdl.handle.net/2437/379559In this paper we are going to present a teaching/learning method and suggest a syllabus that help the high school students look at the algorithm design strategies from a so called "upperview": greedy, backtracking, divide and conquer, dynamic programming. The goal of the suggested syllabus is, beyond the presentation of the techniques, to offer the students a view that reveals them the basic and even the slight principal differences and similarities between the strategies. In consensus with the Comenius principle this is essential, if we want to master this field of programming ("To teach means scarcely anything more than to show how things differ from one another in their different purposes, forms, and origins. ... Therefore, he who differentiates well teaches well.").application/pdfteaching methodalgorithm design strategiesalgorithm design techniquesfolyóiratcikkOpen AccessZoltán Kátaihttps://doi.org/10.5485/TMCS.2005.0095Teaching Mathematics and Computer Science23Teach. Math. Comp. Sci.2676-8364