Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re^7: Algorithm for cancelling common factors between two lists of multiplicands (192.5 ms)

by sk (Curate)
on Aug 14, 2005 at 01:03 UTC ( [id://483641]=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    
    #!/usr/bin/perl
    ...
    }
    
  2. or download this
    C:\>perl fet 989 9400 43300 2400
    Ratio = 0.08070604647867725e-7028
    ...
    C:\>perl buk 1e6 2e6 2e6 1e6
    2.73353759185676100e-147576
    1 trial of [1e6 2e6 2e6 1e6] (70.739s total)
    

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others having an uproarious good time at the Monastery: (5)
As of 2024-03-28 23:14 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found