greedy_knapsack: greedy_knapsack
In menon1234/Lab06: This package gives the different ways to solve the knapsack problem
Description
Usage
Arguments
Value
References
View source: R/greedy_knapsack.r
Description
Knapsack Problem using the greedy approach
Usage
1
greedy_knapsack(x, W)
Arguments
x
value
W
weight
Value
A list giving total no of objects and the maximum weight it can hold
x -knapsack_objects
W - total weight it can hold
References
'https://en.wikipedia.org/wiki/Knapsack_problem'
order data decrasely by value(i)/weight(i)
Problem: value(i)/weight(i) is equal but value(i) is not equal
should order decreasely by value(i) too.
print(new_data)
menon1234/Lab06 documentation built on Nov. 4, 2019, 6:25 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value References
View source: R/greedy_knapsack.r
Description
Knapsack Problem using the greedy approach
Usage
1 | greedy_knapsack(x, W)
|
Arguments
x |
value |
W |
weight |
Value
A list giving total no of objects and the maximum weight it can hold
x -knapsack_objects
W - total weight it can hold
References
'https://en.wikipedia.org/wiki/Knapsack_problem' order data decrasely by value(i)/weight(i) Problem: value(i)/weight(i) is equal but value(i) is not equal should order decreasely by value(i) too. print(new_data)
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.