Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses
 
PerlMonks  

Re^13: Algorithm for cancelling common factors between two lists of multiplicands

by tmoertel (Chaplain)
on Aug 09, 2005 at 06:16 UTC ( [id://482119]=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    module ScientificFormat (sciformat) where
    
    ...
    
    digits n d =
        let (q,r) = n `quotRem` d in q : digits (10*r) d
    
  2. or download this
    module Main (main) where
    import FishersExactTest
    import ScientificFormat
    main = interact $ sciformat 60 . pCutoff . map (map read . words) . li
    +nes
    
  3. or download this
    [thor@arinmir fishers-exact-test]$ time ./fet < ex1.dat
    +8.070604647867604097576877675243109941729476950993498765160880e-7030
    real    0m0.839s
    user    0m0.819s
    sys     0m0.016s
    

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others surveying the Monastery: (8)
As of 2024-04-19 17:21 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found