Re: [PEPr] Comment on Math::Euclideans Algorithm for GCFs

From: Date: Tue, 03 Feb 2004 16:45:52 +0000
Subject: Re: [PEPr] Comment on Math::Euclideans Algorithm for GCFs
References: 1  Groups: php.pear.dev 
Request: Send a blank email to pear-dev+get-25442@lists.php.net to get a copy of this message
On Feb 3, 2004, at 11:29 AM, PEPr wrote:
Michael Wallner (http://pear.php.net/user/mike) has commented on the proposal for Math::Euclideans Algorithm for GCFs. Comment: Hm, recursive function calls are known to eat up memory until segfault. BTW, is the function the whole thingy?
The Euclidean algorithm is about the most naive and expensive way to find the gcf of two numbers. Classical to be sure, but not the way you want to do it. There are modern algorithms (Stein's for instance) which are faster and more efficient. Also, this basic functionality exists in a standard PHP function, gmp_gcd(). So, -1. George

« previous php.pear.dev (#25442) next »