Skip to content
Related Articles

Related Articles

Algorithms | Greedy Algorithms | Question 3
  • Last Updated : 01 Mar, 2013

What is the time complexity of Huffman Coding?
(A) O(N)
(B) O(NlogN)
(C) O(N(logN)^2)
(D) O(N^2)


Answer: (B)

Explanation: O(nlogn) where n is the number of unique characters. If there are n nodes, extractMin() is called 2*(n – 1) times. extractMin() takes O(logn) time as it calles minHeapify(). So, overall complexity is O(nlogn).
See here for more details of the algorithm.

Quiz of this Question

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up
Recommended Articles
Page :