An implementation of the method for computing the greatest common divisor.

EuclideanAlgorithm.java

/* EuclideanAlgorithm.java
 * An implementation of the method for computing the greatest common divisor.
 *
 * Copyright (C) 2011 TAKUMAKei
 *
 * 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.
 */

package com.blogspot.takumakei.gist;

/**
 * An implementation of the method for computing the greatest common divisor.
 */
public class EuclideanAlgorithm {
    public static final int greatestCommonDivisor(int lhs, int rhs) {
        for (;;) {
            if (lhs < rhs) {
                final int swap = lhs;
                lhs = rhs;
                rhs = swap;
            }
            lhs = lhs % rhs;
            if (0 == lhs) {
                return rhs;
            }
        }
    }

    public static final int leastCommonMultiple(int lhs, int rhs) {
        return lhs * rhs / greatestCommonDivisor(lhs, rhs);
    }
}