Q:

Write a method that returns the Greatest Common Divisor of p and q

0

The Greatest Common Divisor of two positive integers is the largest integer that divides both without remainder.
Write a method that returns the Greatest Common Divisor of p and q.

All Answers

need an explanation for this answer? contact us directly to get an explanation for this answer

public Integer gcd(Integer p, Integer q) {
if (q == 0) {
    return p;
}
return gcd(q, p % q);
}

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

This question belongs to these collections

Similar questions


need a help?


find thousands of online teachers now