NIST

primitive algorithm

(definition)

Definition: An algorithm in which all the computable steps are basic operations.

Generalization (I am a kind of ...)
algorithm.

See also compound algorithm, primitive recursive.

Note: Any algorithm is either a primitive algorithm or a compound algorithm. The distinction between primitive and compound is somewhat subjective.

Author: VP

More information

Vreda Pieterse, Topic Maps for Specifying Algorithm Taxonomies: A Case using Transitive Closure Algorithms, doctoral dissertation, University of Pretoria, 2016.


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 24 February 2016.
HTML page formatted Fri Feb 23 10:06:08 2018.

Cite this as:
Vreda Pieterse, "primitive algorithm", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 24 February 2016. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/primitiveAlgorithm.html