\begin{definition}[Definition:Algorithm/Step]
An algorithm consists of a finite set of '''steps''', uniquely identified by means of a label, conventionally numeric.
A '''step''' of an algorithm consists of:
:an '''operation'''
:an '''instruction''' as to what the algorithm is to do next, which will be one of the following:
::$(1): \quad$ By default: to move onto the next '''step''' in the sequence
::$(2): \quad$ Based on the result of a '''condition''', the specific '''step''' to perform next
::$(3): \quad$ To '''terminate'''.
It is usual to include a statement in natural language which briefly describes the purpose of this '''step'''.
A '''step''' may also contain a comment.
\end{definition}