Algorithmics is the systematic study of the design and analysis of
algorithms
In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing ...
.
It is fundamental and one of the oldest fields of
computer science
Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to practical disciplines (includin ...
. It includes
algorithm design, the art of building a procedure which can solve efficiently a specific problem or a class of problem,
algorithmic complexity theory, the study of estimating the hardness of problems by studying the properties of the algorithm that solves them, or
algorithm analysis, the science of studying the properties of a problem, such as quantifying resources in time and memory space needed by this algorithm to solve this problem.
The term algorithmics is rarely used in the English-speaking world, where it is synonymous with ''algorithms and data structures''. The term gained wider popularity after the publication of the book ''Algorithmics: The Spirit of Computing'' by
David Harel.
See also
*
Divide-and-conquer algorithm
*
Heuristic
A heuristic (; ), or heuristic technique, is any approach to problem solving or self-discovery that employs a practical method that is not guaranteed to be optimal, perfect, or rational, but is nevertheless sufficient for reaching an immediat ...
*
Akra–Bazzi method
Notes
{{Computer science