Fast Greatest Common Divisor (GCD) Algorithm

Mauro Leggieri

Rate me:

4.00/5 (1 vote)

18 Feb 2011CPOL

8.4K

It is better to do this:public static long LCM(long a, long b){ return (a / GCD(a,b)) * b;}To avoid overflow on big numbers.

It is better to do this:

public static long LCM(long a, long b)
{
    return (a / GCD(a,b)) * b;
}

To avoid overflow on big numbers.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Written By

Mauro Leggieri

Web Developer

Argentina

My name is Mauro Leggieri. I am 30 year-old, married and have a child.

I am a system engineer (UTN university) and am being programming for more than 20 years from the C64 to the PC and some microcontrollers.

Mostly of my time, I program games for Windows.

Soon, my site http://www.mauroleggieri.com.ar

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.

Fast Greatest Common Divisor (GCD) Algorithm

License

Comments and Discussions