algorithms
I am writing an algorithm in latex and don't know how to distinguish between assignment and collection operations.
Assignments be written as:
A <- B + C
But in case of add to collection, I usually do
A <- {}
loop condition:
A <- A + X
Is there anything else that I can use instead of \leftarrow and not have to write A + X on the right always.
Thanks in advance
The algorithmic environment takes an optional argument. The optional argument is a number that defines the skip between line numbering. The default [0] implies no line numbering, while [1] puts a line number on every line. [2] puts a line number every second line, and so forth:
\documentclass{article}
\usepackage{algorithm,algorithmic}
\begin{document}
\begin{algorithm}
\caption{An algorithm}
\begin{algorithmic}
\IF{some condition is true}
\STATE do some processing
\ELSIF{some other condition is true}
\STATE do some different processing
\ELSIF{some even more bizarre condition is met}
\STATE do something else
\ELSE
\STATE do the default actions
\ENDIF
\end{algorithmic}
\end{algorithm}
\begin{algorithm}
\caption{An algorithm}
\begin{algorithmic}[1]
\IF{some condition is true}
\STATE do some processing
\ELSIF{some other condition is true}
\STATE do some different processing
\ELSIF{some even more bizarre condition is met}
\STATE do something else
\ELSE
\STATE do the default actions
\ENDIF
\end{algorithmic}
\end{algorithm}
\begin{algorithm}
\caption{An algorithm}
\begin{algorithmic}[2]
\IF{some condition is true}
\STATE do some processing
\ELSIF{some other condition is true}
\STATE do some different processing
\ELSIF{some even more bizarre condition is met}
\STATE do something else
\ELSE
\STATE do the default actions
\ENDIF
\end{algorithmic}
\end{algorithm}
\end{document}
Best Answer
I don't think there is a standard for pseudocode. You could write it in a somewhat object-oriented way like this:
In pseudocode I would also avoid + to merge sets, and would rather use the set union symbol, ∪.