Index
Symbols
- * (multiplication operator), Benchmark Operations
- ** (exponentiation operator), Benchmark Operations
- 15-puzzle, Representing State
- 8-puzzle, Search Trees
- 8-Queens Problem, Estimating the Size of a Search Tree
- == operator, Solution
- “Big O” notation, Lower and Upper Bounds
- ≅ (approximately equal), Comparing Floating-Point Values
A
- A*Search algorithm, A*Search
- adjacency lists, Graphs-Graphs, Graph Analysis
- adjacency matrix, Graphs, Dijkstra’s Algorithm for Dense Graphs, Graph Analysis
- Akl-Toussaint heuristic, Solution-Analysis
- algorithms
- Addition, Linear Performance-Linear Performance
- approximation algorithms, Variations on a Theme-Analysis
- Bentley–Faust–Preparata, Approximation
- Bisection, Log n Behavior
- blind-search, Path-Length Heuristic Functions
- building blocks of, Algorithm Building Blocks-Special Quantities
- Counting Search, Best Case
- dealing with computational abstractions (see computational geometry algorithms)
- dealing with networks of vertices and edges (see network flow algorithms)
- defined, Understand the Problem
- emerging categories of, Emerging Algorithm Categories-Estimating the Size of a Search Tree
- expected computation time, The Mathematics of Algorithms
- (see also mathematics)
- Exponentiation by Squaring, Benchmark Operations
- for search queries (see spatial tree structures)
- GCD, Less Obvious Performance Computations-Less Obvious Performance Computations
- Graham’s Scan, Example Algorithm-Analysis, Context
- graph (see graph algorithms)
- Guessing, Log n Behavior
- Hash Sort, Variations-Variations ...
Get Algorithms in a Nutshell, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.