time complexity of huffman coding using greedy is nlogn but
in quiz it is showing correct ans id nlogn^2
Huffman coding (quiz)
@tishya_goyal Yes the time complexity for Hiffman coding using heaps is nlogn. You can write it to support.codingblocks.com for corrections.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.