McqMate
Q. |
What is the running time of the Huffman encoding algorithm? |
A. | o(c) |
B. | o(log c) |
C. | o(c log c) |
D. | o( n log c) |
Answer» C. o(c log c) | |
Explanation: if we maintain the trees in a priority queue, ordered by weight, then the running time is given by o(c log c). |
View all MCQs in
Communication EngineeringNo comments yet