You must disable your AdBlock software in your browser to use this site.
Disable ad blocking for practiceit.cs.washington.edu, then refresh this page to continue.
It is easy to disable AdBlock for just one site while leaving it enabled for other sites.
Just click the "stop sign" icon in the top-right of your browser, then un-check the "Enabled for this site" checkbox.
Thank you for your understanding and helping us to keep Practice-It free of cost for all students to use.
If you are still seeing this message after disabling your ad blocker, try clearing your browser history and refreshing the page.
Also make sure you don't have any other ad-blocking software running outside of your browser, such as a HOSTS file or proxy.
If you are certain that you are not running AdBlock or any other ad-blocking software, but you are still seeing this message,
please Contact Us.
Write a method named gcd that accepts two integers as parameters and returns the greatest common divisor of the two numbers. The greatest common divisor (GCD) of two integers a and b is the largest integer that is a factor of both a and b. The GCD of any number and 1 is 1, and the GCD of any number and 0 is that number.
One efficient way to compute the GCD of two numbers is to use Euclid's algorithm, which states the following:
GCD(A, B) = GCD(B, A % B)
GCD(A, 0) = Absolute value of A
In other words, if you repeatedly mod A by B and then swap the two values, eventually B will store 0 and A will store the greatest common divisor.
For example: gcd(24, 84) returns 12, gcd(105, 45) returns 15, and gcd(0, 8) returns 8.