CS2231 Vanderbilt University Computer Organization Course Arm Assembly Demo 3 Using Euclid's Algorithm to compute greatest common divisor. This program involves branching, loop and subroutine. These are necessary components for relative complex functions and programs.