Java gcd gcd(int a, int b)

Description

This method finds the greatest common divisor: The largest integer or the polynomial (monomial) of highest degree that is an exact divisor or each of two or more integers or polynomials.

License

Apache License

Parameter

Parameter	Description
a	The first multiple.
b	The second multiple.

Declaration

public static int gcd(int a, int b)

Method Source Code

//package com.java2s;
//  Licensed under the Apache License, Version 2.0 (the "License");

public class Main {
    /**/*from www  .j a  va  2  s  .  com*/
     * This method finds the greatest common divisor: The largest integer or the polynomial (monomial) of highest degree
     * that is an exact divisor or each of two or more integers or polynomials.
     *
     * @param a The first multiple.
     *
     * @param b The second multiple.
     *
     * @return
     */
    public static int gcd(int a, int b) {
        int t;

        while (b != 0) {
            t = b;
            b = a % b;
            a = t;
        }

        return a;
    }
}