A

Admin • 833K Points
Coach

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)

Explanation by: Admin

if we maintain the trees in a priority queue, ordered by weight, then the running time is given by o(c log c).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.