Greedy Algorithms and Heuristics
In which of the following scenarios is the use of a greedy algorithm as a heuristic considered LEAST appropriate?
A
Scheduling tasks with different priorities
B
Compressing data using Huffman coding
C
Finding the optimal solution to the knapsack problem
D
Determining an efficient route for a delivery truck
Question Leaderboard
Not enough data yet to show leaderboard.