Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: Malloc with Inline::C

by polettix (Vicar)
on Mar 26, 2005 at 18:30 UTC ( #442531=note: print w/replies, xml ) Need Help??


in reply to Malloc with Inline::C

I've not tried, but the compiler should choke at it. It seems that you don't need it, because the factorial function caches values up to 33, while for larger numbers uses the log-gamma to approximate the factorial you're looking for. Given that it's an approximation, why don't you re-implement gammln in straight Perl and try to get rid of the C function in a first step?

Anyway, if you want some BigDouble you should look for some ad-hoc lib (like GMP cited above) - if it were as simple as you're trying, those libs probably wouldn't exist :) Moreover, are you really convinced you need to compute such big factorials? (This is becoming OT, so if you want write about it in some math forum or, if you want my opinion, write me to flavio (at) polettix (dot) it).

Flavio

Don't fool yourself.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (7)
As of 2020-01-23 18:38 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?