GCD (Greatest Common Divisor)
=============================

Computes the GCD of two numbers using Euclidean algorithm.

.. literalinclude:: ../../examples/gcd.asm
   :language: asm
   :linenos:

Demonstrates division, modulo operation, and iterative algorithm.