Java gcd gcd(int p, int q)

Description

Computes the Greatest Common Devisor of integers p and q.

License

Open Source License

Parameter

Parameter	Description
p	a parameter
q	a parameter

Return

gcd

Declaration

public static int gcd(int p, int q) 

Method Source Code

//package com.java2s;
/*/*from   ww  w  . ja v a 2  s .  c om*/
 *   __               .__       .__  ._____.           
 * _/  |_  _______  __|__| ____ |  | |__\_ |__   ______
 * \   __\/  _ \  \/  /  |/ ___\|  | |  || __ \ /  ___/
 *  |  | (  <_> >    <|  \  \___|  |_|  || \_\ \\___ \ 
 *  |__|  \____/__/\_ \__|\___  >____/__||___  /____  >
 *                   \/       \/             \/     \/ 
 *
 * Copyright (c) 2006-2011 Karsten Schmidt
 * 
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 * 
 * http://creativecommons.org/licenses/LGPL/2.1/
 * 
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
 */

public class Main {
    /**
     * Computes the Greatest Common Devisor of integers p and q.
     * 
     * @param p
     * @param q
     * @return gcd
     */
    public static int gcd(int p, int q) {
        if (q == 0) {
            return p;
        }
        return gcd(q, p % q);
    }
}

Related

1. gcd(int m, int n)
2. gcd(int n, int m)
3. gcd(int n1, int n2)
4. gcd(int num1, int num2)
5. gcd(int p, int q)
6. gcd(int u, int v)
7. gcd(int u, int v)
8. gcd(int u, int v)
9. gcd(int x, int y)