Question

Which of the following problems cannot be solved using greedy algorithms for optimal result?

A Fractional Knapsack
B Job Sequencing with Deadlines
C Huffman Encoding
D 0/1 Knapsack
E Minimum Spanning Tree
Practice Next

Hey! Ask a query