Best way of calculating n choose k?
Here is my version, which works purely in integers (the division by k always produces an integer quotient) and is fast at O(k): function choose(n, k) if k == 0 return 1 return (n * choose(n – 1, k – 1)) / k I wrote it recursively because it’s so simple and pretty, but you … Read more