Advertisement
Guest User

Untitled

a guest
Mar 5th, 2015
192
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.26 KB | None | 0 0
  1. // recursive greatest common devisor function
  2. int gcd(int a, int b){
  3. // assume x, y >= 1
  4. int max = Math.max(a, b);
  5. int min = Math.min(a, b);
  6. int remainder = max % min;
  7. if (remainder == 0) {
  8. return min;
  9. } else {
  10. return ggT(min, remainder);
  11. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement