How deeply does Advanced Algorithms and Data Structures cover memoization?

Explains cache lookup and storage in recursive planarity testing, but stops short of a general implementation survey.

Memoization

As explained in Advanced Algorithms and Data Structures

Memoization is a technique that caches the results of computations so repeated calls with the same inputs can reuse them.

Memoization caches results from smaller recursive subproblems so repeated calls can reuse them instead of recomputing duplicate work. In recursive graph algorithms, this can prevent explosive expansion and memory failure, although it may still leave too many possible subgraphs to make the algorithm practical. section 15.2.4

Use memoization when recursive computation revisits the same states:

Choose a representation for each subproblem that can serve as a cache key. section 15.2.4
Check the cache before recursing; return the stored result when the state has already been examined. section 15.2.4
Trade computation time for memory: caching avoids repeated work but does not necessarily reduce the total number of possible states enough for large inputs. section 15.2.4

How Advanced Algorithms and Data Structures covers it

Cover of Advanced Algorithms and Data Structures

liveBook manning.com

Read Advanced Algorithms and Data Structures on liveBook Get the book at manning.com

Also explained in

liveBook manning.com

Fabulous Adventures in Data Structures and AlgorithmsA memoized function is a function wrapper that returns cached results for inputs previously evaluated by the original function.
liveBook manning.com

React in DepthMemoization is a technique that caches a computation or component result so it can be reused when relevant inputs have not changed.
liveBook manning.com

Functional Programming in JavaScriptA technique that caches the results of function calls so repeated calls with the same inputs can reuse prior results instead of recomputing.
liveBook manning.com

LatencyMemoization is a technique that caches the results of computations so repeated calls with the same inputs can return stored results.
liveBook manning.com

Classic Computer Science Problems in Swift: Essential techniques for practicing programmersMemoization is an optimization technique that caches the results of computations so repeated requests for the same inputs can be answered without recomputation.
liveBook manning.com

Clojure: The Essential ReferenceMemoization is a caching technique that stores the results of function evaluations keyed by their inputs.
liveBook manning.com

Secrets of the JavaScript Ninja, Second EditionA technique that stores computed results so repeated calls with the same inputs can reuse them.

Compare how 8 books explain memoization →

Related concepts

useCallbackused by · useCallback is a React Hook that memoizes a function reference and reuses it across renders until its specified dependencies change.
useMemoused by · useMemo is a React Hook that caches a calculated value between renders and recomputes it when specified dependencies change.
dynamic programmingused by · Dynamic programming is an algorithmic technique that solves problems by decomposing them into overlapping subproblems and storing or reusing their solutions.
cachinguses · Caching is the practice of storing reusable data or computation results so later access can avoid repeating retrieval or computation.
functionproduces · A function is a callable program unit that performs an operation, may accept inputs, and can produce a result or side effect.

This explainer was generated by Manning's knowledge graph from the text of Advanced Algorithms and Data Structures. The section links point to the parts of the book it draws on.