Java gcd gcdRec(int a, int b)

Description

Recursive approach for finding greatest common divisor using Euclid's algorithm.

License

Apache License

Parameter

Parameter	Description
a	a parameter
b	a parameter

Declaration

public static int gcdRec(int a, int b) 

Method Source Code

//package com.java2s;
/*/*from   w w w  .j  a  v a  2s. c om*/
 * org.fsola
 *
 * File Name: GreatestCommonDivisor.java
 *
 * Copyright 2014 Dzhem Riza
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

public class Main {
    /**
     * Recursive approach for finding greatest common divisor using Euclid's
     * algorithm.
     *
     * @param a
     * @param b
     * @return
     */
    public static int gcdRec(int a, int b) {
        return (b == 0) ? a : gcdRec(b, a % b);
    }
}

Related

1. gcd1(long given1, long given2)
2. GCDHelper(long a, long b)
3. gcdMultiple(int[] nums)
4. gcdPositive(int a, int b)
5. gcdPositive(int... args)
6. gcdUsingEuclides(long x, long y)
7. gcdUsingRecursion(long a, long b)