A

Admin • 833K Points
Coach

Q. What is the running time of the Huffman algorithm, if its implementation of the priority queue is done using linked lists?

  • (A) o(c)
  • (B) o(log c)
  • (C) o(c log c)
  • (D) o(c2)

Explanation by: Admin

if the implementation of the priority queue is done using linked lists, the running time of huffman algorithm is o(c2).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.