Articles

"Frontier algorithms"

Published:
2008-06-01
Author
View
Keywords
License

Copyright (c) 2008 Zoltán Kátai

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How To Cite
Selected Style: APA
Kátai, Z. (2008). "Frontier algorithms". Teaching Mathematics and Computer Science, 6(1), 139-152. https://doi.org/10.5485/TMCS.2008.0193
Abstract
In 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.