1.

Which of following problems cannot be solved using greedy approach?

A. Minimum spanning tree problem
B. Single source shortest path problem
C. Huffman code problem
D. 0-1 knapsack problem
Answer» E.


Discussion

No Comment Found