Java Glossary : GCD

Last updated 2004-06-28 by Roedy Green ©1996-2004 Canadian Mind Products

Java definitions: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

You are here : home : Java Glossary : G words : GCD.

GCD

Euclid, the ancient Greek mathematician, discovered how to find the Greatest Common Divisor of two integer, the biggest integer that divides evenly into both of them. Here is the code:

/**
  * Euclid's greatest common divisor algorithm.
  * Find the largest number that evenly divides into both n and d.
  * require: n >= 0, d >= 0.
  * fastest if n >= d.
  */
public static int gcd(int n, int d)
   {
   if ( d == 0 )
      {
      return 1;
      }
   int r = n % d;
   return( r == 0 ) ? d : gcd( d , r );
   }

LCD ¤ LCM

home	Canadian Mind Products
	mindprod.com IP:[24.87.56.253]
	Your IP:[80.134.30.163]
	You are visitor number 1710.
	Please send errors, omissions and suggestions
	to improve this page to Roedy Green.
	You can get a fresh copy of this page from:	or possibly from your local J: drive mirror:
	http://mindprod.com/jgloss/gcd.html	J:\mindprod\jgloss\gcd.html