Question: Write a program to find the greatest common divisor (GCD) of two 16-bit numbers stored at $1000~$1001 and $1002~$1003, and store the result at $1010~1011.
Write a program to find the greatest common divisor (GCD) of two 16-bit numbers stored at $1000~$1001 and $1002~$1003, and store the result at $1010~1011. Enter the two test numbers manually at the beginning of your code. The most efficient method for finding the greatest common divisor is the Euclidean method.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
