Match the following:

(A) (1)
(B) (2)
(C) (3)
(D) (4)


Answer: (C)

Explanation:

• Huffman codes takes O(nlgn) time.
• Optimal polygon triangulation takes θ(n³) time

Activity selection problem takes θ(n) time

• Quicksort takes O(n²) time

So, option (C) is correct.


Quiz of this Question