!!!Assembly Language x86 only!!! INCLUDE Irvine32.inc with .asm file
Greatest Common Divisor
Write a recursive implementation of Euclidâ€™s algorithm for finding the greatest common divisor (GCD) of two integers.
The Euclidean algorithm:
– Input: Two positive integers, a and b.
– Output: The greatest common divisor, g, of a and b.
– Internal computation
Â—If a<b, exchange a and b.
Â—If b=0, report a as the GCD of a and b
Â—Divide a by b and get the remainder, r. If r=0, report b as the GCD of a and b.
Â—Replace a by b and replace b by r. Return to the previous step.
Write a test program that calls your GCD procedure five times, using the following pairs of integers: (35,15), (72,18), (31,17), (128,640), (121,0). After each procedure call, display the GCD.