knapsack-min-overflow
Solves a variation of knapsack problem. Target is to fulfill `capacity` using values from the `values` array while minimizing overflow over `capacity`.
Solves a variation of knapsack problem. Target is to fulfill `capacity` using values from the `values` array while minimizing overflow over `capacity`.
Select combinations or permutations of items in a list, or the number of ways of selecting items
Combinatorial generators including combinations, permutations, combinations with replacement, permutations with replacement, cartesian products, and power sets.
Tools for combinatorics
Hypergeometric distribution cumulative distribution function (CDF).
Hypergeometric distribution quantile function.
Shuffle elements of an array-like object.
Create an iterator which evaluates the natural logarithm of the factorial function for each iterated value.
Create an iterator which evaluates the factorial function for each iterated value.
Compute the binomial coefficient.
Compute the natural logarithm of the binomial coefficient.
Evaluate a factorial.
Evaluate the double factorial.
Evaluate the natural logarithm of the factorial function.
Catalan's constant.
Create an iterator which generates a sequence of factorials.