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

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

by QM (Parson)
on Aug 09, 2005 at 15:19 UTC ( [id://482242]=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    sub n_choose_k {
  my ($n, $k) = @_;
  # f($n) = $n!
  return f($n)/f($k)/f($n-$k);
}
  2. or download this
    sub n_choose_k {
  my ($n, $k) = @_;
...
  }
  return $t;
}

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://482242]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others goofing around in the Monastery: (3)
As of 2024-04-26 04:05 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found