Description Usage Arguments Value
View source: R/brute_force_knapsack.R
Brute force solution for the knapsack problem
1 | brute_force_knapsack(x, W, parallel = FALSE)
|
x |
data structure of weights and values |
W |
max weight |
parallel |
TRue if with parallel, False (default if not) |
most valued combination of elements which fits backpack and the maximum value achieved
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.