Algorithms on Data Structure and Algorithms related Questions and Answers


Question :   What is the running time of the Huffman algorithm, if its implementation of the priority queue is done using linked lists?
1. O(C)
2. O(log C)
3. O(C log C)
4. O(C2)
Answer :   4 - O(C2)  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter