Kátai, Zoltán2024-09-042024-09-042008-06-01Teaching Mathematics and Computer Science, Vol. 6 No. 1 (2008) , 139-1521589-7389https://hdl.handle.net/2437/379627In this paper we present a new method to compare algorithm design strategies. As in case of frontier towns the cultures blend, the so called "frontier algorithms" are a mixture of different programming techniques like greedy, backtracking, divide and conquer, dynamic programming. In case of some of them the frontier character is hidden, so it has to be discovered. There are algorithms that combine different techniques purposively. Furthermore, determining the programming technique the algorithm is using can be a matter of point of view. The frontier algorithms represent special opportunities to highlight particular characteristics of the algorithm design strategies. According to our experience the frontier algorithms fit best to the revision classes.application/pdfteaching methodsalgorithm design strategiesprogramming techniquescase studyfolyóiratcikkOpen AccessZoltán Kátaihttps://doi.org/10.5485/TMCS.2008.0193Teaching Mathematics and Computer Science16Teach. Math. Comp. Sci.2676-8364