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
I had been asked this question by my school teacher while I was bunking the class.
Query is from Greedy Algorithms topic in division Greedy Algorithms of Data Structures & Algorithms II