New answers tagged greedy-algorithms
1
vote
Is Huffman coding dynamic programming
dynamic programming always give optimal solution whereas greedy algorithm is sub-optimal
Not True. There are problems where even a greedy approach would result in an optimal solution(Fractional ...
Top 50 recent answers are included
Related Tags
greedy-algorithms × 386algorithms × 228
dynamic-programming × 59
graphs × 57
optimization × 56
correctness-proof × 42
algorithm-analysis × 32
approximation × 28
scheduling × 23
knapsack-problems × 16
intervals × 16
time-complexity × 12
proof-techniques × 12
combinatorics × 11
sorting × 10
minimum-spanning-tree × 8
matroids × 8
trees × 7
set-cover × 7
np-complete × 6
np-hard × 6
shortest-path × 6
arrays × 6
number-theory × 6
data-structures × 5