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

I had left in a call to shift that I shouldn't. It's fixed, now.

Caution: Contents may have been coded under pressure.

Comment on Re^4: OT: Finding Factor Closest To Square Root

Replies are listed 'Best First'.
Re^5: OT: Finding Factor Closest To Square Root by Limbic~Region (Chancellor) on Feb 28, 2005 at 21:53 UTC
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` [download] 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	[reply] [d/l]

Replies are listed 'Best First'.

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
[download]

Cheers - L~R