Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

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

by hv (Parson)
on Aug 13, 2005 at 00:20 UTC ( #483469=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    zen% perl t1
    807060464786760409757687767524310994172947695099349876516088e-7089
    ...
    
    total: 13 wallclock secs (13.37 usr +  0.02 sys = 13.39 CPU)
    zen% 
    
  2. or download this
    #!/usr/bin/perl -w
    use strict;
    ...
    sub time_delta {
      print +shift, ": ", timestr(timediff(@_)), "\n";
    }
    

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (9)
As of 2019-10-14 12:53 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?