New answers tagged

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 ...
user avatar
  • 405

Top 50 recent answers are included