Algorithm

Extends: 
Is Abstract: 
yes
Is Pattern: 
yes
Definition: 

An algorithm is an effective method that can be expressed within a finite amount of space and time and in a well-defined formal language for calculating a function. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input. [from www.wikipedia.org 15 April 2016]

The underlying properties of the algorithm or method rather than the specifics of any particular implementation. In short a description of the method in its simplest and most general representation.

Property: 
NameCardinalityDatatypeDescription
overview
0..1
Provides a high level overview or summary of the class. Can be used to inform end-users or as part of an executive summary. Supports the use of multiple languages and structured text.
Relationship: 
NameTarget ObjectDescriptionSource cardinalityTarget cardinalityRelationship type
isDiscussedIn
Identifies material discussing the algorithm. The material may be in DDI or other format.
0..n
0..n
Neither

Stage:

Is extendable: 
Is property: 
0
RDF Mapping: