Algorithm

An algorithm is a finite, precisely specified sequence of steps for solving a problem or performing a computation. It transforms inputs into outputs or determines that no solution exists.

Pseudocode: An informal, programming-language-independent notation for describing computational procedures. It expresses an algorithm’s steps clearly without committing to executable syntax.
Input–output model: A model that describes a computation in terms of supplied inputs and produced outputs. It frames an algorithm as a procedure that maps problem instances to results.
Binary search: A search algorithm that repeatedly halves a sorted range to locate a target or establish its absence. It demonstrates how a problem’s structure can reduce the number of required steps.
Heuristic: A practical method that seeks useful results without guaranteeing an exact solution or optimality. Unlike an exact algorithm, a heuristic may trade guarantees for speed or simplicity.
Control flow: The order in which instructions are executed, including branches, loops, and procedure calls. It determines which steps an algorithm performs and in what order.
Mathematical function: A relation that assigns exactly one output to each element of its domain. Many algorithms are specified by the function they must compute.
Euclidean algorithm: A procedure for finding the greatest common divisor of two integers using repeated remainders. It is a classic example of a concise algorithm with a mathematical correctness argument.
Randomized algorithm: An algorithm that uses random choices during computation. Its behavior may depend on random outcomes, unlike a deterministic procedure.
Recursion: A technique in which a procedure solves a problem by calling itself on smaller instances. Recursive algorithms organize repeated work through smaller versions of the same problem.
Computational problem: A formally stated task whose instances require a computational answer or decision. An algorithm is designed to solve a particular computational problem.

Linked from 48 pages