Please enable JavaScript.
Coggle requires JavaScript to display documents.
ACM algorithms and recursion (AL (19-9) (Strategies (5-1) (dynamic…
ACM algorithms and recursion
AL (19-9)
basic analysis (2-2)
Strategies (5-1)
divide-and-conquer
dynamic programming:remembers past results and uses them to find new results
8 queens problem
Requires “optimal substructure” and “overlapping subproblems”
Fibonacci, with memoization
backtracking builds candidates to the solutions, and abandons a candidate ("backtracks") as soon as it determines that the candidate cannot possibly be completed to a valid solution.
recursive
primitive recursive
innately / generally recursive
Ackermann
non-trivial recursion
compilers
Ariadne's tread (in logic)
DS & algoritms (9-3)
recursion
guarded recurision
In Haskell:
https://wiki.haskell.org/Tail_recursion
Basic automata, computability and complexity (3-3)
DS (37-4)
Theoretical basis: set theory, logic, graph theory and probability theory
recursive data structures
trees
linked lists
graphs
SDF (43)
CN (1-0)
IS
Basic Search Strategies
PD
parallel algorithms
parallelism
SE
formal methods
PL
modicum of recursion
tail call optimization (TCO)