Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

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

by QM (Parson)
on Aug 10, 2005 at 18:36 UTC ( [id://482708]=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    O(GCD) ~= 4.785*log(N) + 0.6723
  2. or download this
    Avg(GCD) ~= 0.1775*N
  3. or download this
    Avg(GCD) ~= 1.9405*log10(N)

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://482708]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others learning in the Monastery: (5)
As of 2024-04-24 22:13 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found