Java gcd gcd(int u, int v)

Description

Modern Euclidian algorithm

License

Open Source License

Parameter

Parameter	Description
u	a parameter
v	a parameter

Return

greatest common divisor

Declaration

public static int gcd(int u, int v) 

Method Source Code

//package com.java2s;
/* //  w w  w.j a v  a  2 s .  c  o m
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program 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 General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 */

public class Main {
    /**
     * Modern Euclidian algorithm
     * 
     * @param u
     * @param v
     * @return greatest common divisor
     */
    public static int gcd(int u, int v) {
        int t = 0;
        if (u < v) {
            t = u;
            u = v;
            v = t;
        }
        while (v != 0) {
            t = u % v;
            u = v;
            v = t;
        }

        return u;
    }
}

Related

1. gcd(int num1, int num2)
2. gcd(int p, int q)
3. gcd(int p, int q)
4. gcd(int u, int v)
5. gcd(int u, int v)
6. gcd(int x, int y)
7. gcd(int x1, int x2)
8. gcd(int[] array)
9. gcd(Integer... values)