Algorithmics: theory & practice
Algorithmics: theory & practice
Algorithms
Algorithms from P to NP (vol. 1): design and efficiency
Algorithms from P to NP (vol. 1): design and efficiency
Fundamentals of algorithmics
Foundations of algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Multidimensional divide-and-conquer
Communications of the ACM
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
Computer Algorithms: C++
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Design and analysis of algorithms reconsidered
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
Teaching advanced problem solving: implications for the CS curriculum
CCSC '00 Proceedings of the fourteenth annual consortium on Small Colleges Southeastern conference
Using puzzles in teaching algorithms
SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education
Algorithm analysis for returning adult students
Journal of Computing Sciences in Colleges
Analyze that: puzzles and analysis of algorithms
Proceedings of the 36th SIGCSE technical symposium on Computer science education
NP-completeness for all computer science undergraduates: a novel project-based curriculum
Journal of Computing Sciences in Colleges
An Experimental Method for the Active Learning of Greedy Algorithms
ACM Transactions on Computing Education (TOCE)
| Hi-index | 0.00 |
Algorithms have come to be recognized as the cornerstone of computing. Surprisingly, there has been little research or discussion of general techniques for designing algorithms. Though several such techniques have been identified, there are serious shortcomings in the existing taxonomy. The paper points out these shortcomings, reevaluates some of the techniques, and proposes a new, hierarchical classification scheme by grouping techniques according to their level of generality. A variety of examples from different areas of computing are used to demonstrate the power and flexibility of the taxonomy being proposed.