Q. |
Which of the following algorithms is the best approach for solving Huffman codes? |
A. | exhaustive search |
B. | greedy algorithm |
C. | brute force algorithm |
D. | divide and conquer algorithm |
Answer» B. greedy algorithm | |
Explanation: greedy algorithm is the best approach for solving the huffman codes problem since it greedily searches for an optimal solution. |
Login to Continue
It will take less than 2 minutes