D.12: Algorithm Design
From
Discrete Math Learning modules
D.12 Algorithm Design: Understand methods of algorithm design and its relationship to data structures.
D.12.1 Design algorithms using recurrence or iteration. D.12.2 Design algorithms using divide-and-conquer. D.12.3 Design algorithms using recursion. D.12.4 Evaluate the efficiency of an algorithm including the order of complexity of algorithms. D.12.5 Demonstrate understanding of the relationship of set theory, relations, functions, combinatorics, sequences, series, graph theory, and matrices to the design of data structures and algorithms. D.12.6 Demonstrate understanding of the relationship of data structures to the design of algorithms and use this understanding to analyze algorithms.
These are links to information about Algorithm Design:
