Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re^5: OT: Finding Factor Closest To Square Root

by Limbic~Region (Chancellor)
on Feb 28, 2005 at 21:53 UTC ( [id://435206]=note: print w/replies, xml ) Need Help??


in reply to Re^4: OT: Finding Factor Closest To Square Root
in thread OT: Finding Factor Closest To Square Root

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.

$ time ./rjnew.pl real 1m8.446s user 1m1.338s sys 0m0.440s
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

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://435206]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (5)
As of 2024-03-28 08:45 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found