RE: [PHP] math help

Ahh.. well i didn't know that. I was always taught that using recusive calls was (for the most part) faster than using a big loop (you know all that Big O notation stuff that I learned in school a couple of years ago). But thanks for the info! Jay -----Original Message----- From: jeremy brand [mailto:jeremy@nirvani.net] Sent: Friday, August 25, 2000 3:57 PM To: Paulson, Joseph V. "Jay" Cc: php-general@lists.php.net Subject: RE: [PHP] math help > Instead of using a for loop or something of that nature you could always use > recursion to really zip through this fast! :) Since when is recursion considered zippy? (easy maybe). But, in my experience, if you can write something non recursive to to the same task, it is usually faster than recursion. With recursion, you always have the possibility of exausting system resources... thus adding to the possible non-zippy-ness. Just my $0.02. -jeremy brand _______________________________________________________________________ GnuPG Fingerprint: 9F5E 95E0 1CC2 E054 84EA 6099 8ACD 9DBA D2C0 5EA9 _ http://www.JeremyBrand.com/Jeremy/Brand/Jeremy_Brand.html for more __ -- PHP General Mailing List (http://www.php.net/) To unsubscribe, e-mail: php-general-unsubscribe@lists.php.net For additional commands, e-mail: php-general-help@lists.php.net To contact the list administrators, e-mail: php-list-admin@lists.php.net