There's more than one way to do things | |
PerlMonks |
Re^5: OT: Finding Factor Closest To Square Rootby Limbic~Region (Chancellor) |
on Feb 28, 2005 at 21:53 UTC ( [id://435206]=note: print w/replies, xml ) | Need Help?? |
Roy Johnson,
It's fixed, now. Mostly. It gives the number instead of 1 if the number is prime. That really isn't a big deal. So you have a couple of the fastest implementations. The Inline::C is only barely winning though that might be static. The interesting thing is that many solutions are faster than using Math::Pari to get a list of factors and doing a binary search. Cheers - L~R
In Section
Seekers of Perl Wisdom
|
|