BookML test: the algorithmicx package

Algorithm 1 Euclid’s algorithm

procedure Euclid( $a,b$ ) $\triangleright$  The g.c.d. of a and b

      $r\leftarrow a\bmod b$

     while  $r\not=0$  do $\triangleright$  We have the answer if r is 0

          $a\leftarrow b$

          $b\leftarrow r$

          $r\leftarrow a\bmod b$

     end while

     return  $b$  $\triangleright$  The gcd is b

9: end procedure

repeat $\triangleright$  forever

2: this

until you die.