(definition)

**Definition:**
An *algorithm* in which one or more of the computable steps is a call to execute another algorithm.

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

*algorithm*.

**See also**
*primitive algorithm*.

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

Author: VP

**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 Wed Mar 13 12:42:45 2019.

Cite this as:

Vreda Pieterse, "compound algorithm", in
*Dictionary of Algorithms and Data Structures* [online], Paul E. Black, ed. 24 February 2016. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/compoundAlgorithm.html