1. Greatest Common Divisor (GCD)

The greatest common divisor (GCD) of two integers is the largest integer that will evenly divide both integers. The GCD algorithm involves integer division in a loop, described by the following C++ code:

Also do the flowchart….

int GCD(int x, int y) {


x = abs(x); y = abs(y); do {

int n = x % y; x = y; y = n;

} while (y > 0); return x;

// absolute value

Implement this function in assembly language and write a test program that calls the function several times, passing it different values.

Source link

Leave a Reply

Your email address will not be published. Required fields are marked *