GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes

What is the time complexity of Huffman Coding?

A

O(N)

B

O(NlogN)

C

O(N(logN)^2)

D

O(N^2)

asked in Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer by gate

Related questions

The best answer to any question