In [11] and [12], it is argued that describing an algorithm using a transition system instead of pseudocode makes it easier to prove its properties, compare it with other algorithms, and design new algorithms.