Go to the source code of this file.
Functions | |
| template<class item_class> item_class | gcd (const item_class &a, const item_class &b) |
This module consists of function which implements Euclidian algorithm for greatest common divisor producing.
|
|||||||||||||||||||
|
Euclidian algorithm produces the greatest common divisor of two integer u and v.
|
1.2.9.1 written by Dimitri van Heesch,
© 1997-2001