Algorithm
An algorithm is a finite, precisely specified procedure for performing a computation, transforming inputs into outputs, or solving a problem.
Algorithms Every Programmer Should Know
An algorithm is a finite step-by-step procedure that transforms specified inputs into a solution to a problem.
- How it is used
- Provides repeatable steps for specified problems and a basis for choosing solutions under practical constraints.
- How deep it goes
- Defines the procedure, traces search cases, and compares efficiency; leaves detailed implementations of individual algorithms to later treatments.
- Examples
- Uses sorting alternatives, a linear-search trace, production bottlenecks, and stable-matching scale and bias.
- What you can do after
- Evaluate/understand it by checking correctness, tracing edge cases, and weighing time, memory, scale, and maintainability.
Read how Algorithms Every Programmer Should Know explains algorithm →
Fabulous Adventures in Data Structures and Algorithms
An algorithm is a finite, precise procedure for solving a problem or computing a result.
- How it is used
- Frames problem solving as finite procedures whose usefulness depends on the problem and the data they operate on.
- How deep it goes
- Defines algorithms and their complexity, then illustrates cost growth; it does not derive a general implementation method.
- Examples
- Uses ad selection, array access, integer summation, map coloring, Sudoku, and Game of Life optimization.
- What you can do after
- Evaluate/understand it by identifying a procedure and comparing how its resource cost grows with problem size.
Read how Fabulous Adventures in Data Structures and Algorithms explains algorithm →
How Computers Make Books
An algorithm is a finite, explicit sequence of instructions for carrying out a computation or solving a problem.
- How it is used
- Uses explicit steps to turn text searching into a procedure a computer can follow.
- How deep it goes
- Works through a complete pseudocode search and comparison procedure, including bounds, matching, failure, and recursive advancement.
- Examples
- Traces horses through “houses and horses and hearses,” locating the match at position 11.
- What you can do after
- Build it from scratch as a pseudocode text search that tests each possible starting position.
Also covered in
- Effective Data Analysis
- Hidden InfluencesIn early access (MEAP)
- Geometry for Programmers
- AI Model EvaluationIn early access (MEAP)
- Delivering Machine Learning Projects: From design to deployment
- Machines that ThinkIn early access (MEAP)
- Demand Forecasting Best Practices
- Julia as a Second Language
- The Art of Unit Testing 3e
- Data Without Labels
- The Creative Programmer
- Understanding AIIn early access (MEAP)
What to know first
- programming languageA programming language is a formal language with defined syntax and semantics for expressing computations and instructions that a computer can execute, interpret, or translate.
- deep learningDeep learning is a machine-learning approach that uses neural networks with multiple computational layers to learn representations from data.
- probability theoryProbability theory is the mathematical framework for quantifying and reasoning about uncertainty in events, variables, and outcomes.
- arrayAn array is an ordered collection of elements organized in one or more dimensions and accessible by position or index.
Related concepts
- backtrackingincludes · Backtracking is a technique that returns to earlier decisions or states along a path to reconsider choices, explore alternatives, or reconstruct a solution.
- breadth-first searchincludes · Breadth-first search is a graph or tree traversal algorithm that explores nodes in nondecreasing order of their distance from a starting node.
- Floyd–Warshallincludes · Floyd–Warshall is a dynamic programming algorithm for computing shortest-path distances between every pair of vertices in a weighted graph.
- A* algorithmincludes · A* is an informed graph-search algorithm that prioritizes paths or states by combining the cost incurred so far with a heuristic estimate of the remaining cost to a goal.
- Bron–Kerbosch algorithmincludes · The Bron–Kerbosch algorithm is a recursive backtracking algorithm for enumerating the maximal cliques of an undirected graph.
- Christofides algorithmincludes · A polynomial-time approximation algorithm for the metric traveling salesman problem with a worst-case tour length no greater than 1.5 times optimal.
Questions about algorithm
What is algorithm?
An algorithm is a finite, precisely specified procedure for performing a computation, transforming inputs into outputs, or solving a problem.
Which Manning books explain algorithm?
Algorithms Every Programmer Should Know, Fabulous Adventures in Data Structures and Algorithms and How Computers Make Books.
What should I know before learning algorithm?
Manning books that teach algorithm usually introduce programming language, deep learning, probability theory and array first.
What kinds of algorithm are there?
Kinds of algorithm include backtracking, breadth-first search, Floyd–Warshall, A* algorithm, Bron–Kerbosch algorithm and Christofides algorithm.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.


