Add fractional Knapsack problem Solution with Greedy Algorithm in Others

[thomas2400]

Solving the popular knapsack problem with greedy Algorithm.

The greedy algorithm will select the item to be keep in bag based on their cost which is the product of weight and value of the item.

                                 value                      Weight
   item 1                         90                          10
   item 2                        100                          20
   item 3                        120                          30

bag capacity = 50

max value to be obtained = 270

[stale]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[stale]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!