Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

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

by BrowserUk (Pope)
on Aug 12, 2005 at 22:32 UTC ( #483442=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    #! perl -slw
    use strict;
    ...
    [5 0 1 4]
    2.38095238095238090e-2
      1 trial  of _default (    564us total), 564us/trial
    
  2. or download this
    P:\test>FET4 1e5 2e5 2e5 1e5
    [1e5 2e5 2e5 1e5]
    1.32499459649722560e-14760
      1 trial  of _default (  81.148s total), 81.148s/trial
    

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (6)
As of 2019-11-20 19:32 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Strict and warnings: which comes first?



    Results (100 votes). Check out past polls.

    Notices?