top button
Flag Notify
    Connect to us
      Facebook Login
      Site Registration

Facebook Login
Site Registration

What is the time and space complexity of huffman coding?

+1 vote
627 views
What is the time and space complexity of huffman coding?
posted Jul 3, 2017 by anonymous

Share this question
Facebook Share Button Twitter Share Button LinkedIn Share Button

1 Answer

0 votes

Time complexity is O(nlogn) and Space complexity is O(n).

answer Jul 13, 2017 by Rohini Dv
Similar Questions
+1 vote

What is huffman coding and what would be huffman code for the following characters?

Character   Frequency
a           10
l           15
i           12
o           3
u           4
s           13
t           1

Explain with suitable diagram?

+2 votes

Assume priority queue in Dijkstra’s algorithm is implemented using a sorted link list and graph G (V, E) is represented using adjacency matrix.

What is the time complexity of Dijkstra’s algorithm (Assume graph is connected)?

Contact Us
+91 9880187415
sales@queryhome.net
support@queryhome.net
#280, 3rd floor, 5th Main
6th Sector, HSR Layout
Bangalore-560102
Karnataka INDIA.
QUERY HOME
...