Explain why a greedy method provides suboptimal solutions to the 0-1 knapsack problem but provides optimal solutions

Question:

Explain why a greedy method provides suboptimal solutions to the 0-1 knapsack problem but provides optimal solutions to the fractional knapsack problem. Could there be a search tree for which greedy search found optimal solutions?

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: