UGC-NET | UGC NET CS 2016 July – III | Question 34
Match the following:
- Huffman codes takes O(nlgn) time.
- Optimal polygon triangulation takes θ(n3) time
Activity selection problem takes θ(n) time
- Quicksort takes O(n2) time
So, option (C) is correct.
Quiz of this Question