===============================
Greatest Common Divisor Program (Version 2)
===============================
-IAN! Ian! D. Allen - idallen@ncf.ca

Write the pseudocode and LMC assembly language for the following algorithm:

    Input two integers.  Put one into "large" and one into "small".
    Repeat until "small" equals "large":
        If "small" is bigger than "large", swap the numbers.
        Subtract "small" from "large" and put result in "large".
    Output "small".

GCD Pseudocode

    ... HOMEWORK ...

;Label  Mnem.   Operand Comments.............
;-----  -----   ------- ---------------------

    ... HOMEWORK ...