GATE | GATE-CS-2017 (Set 2) | Question 17
Match the algorithms with their time complexities:
(A) P-> (iii), Q -> (iv), R -> (i), S -> (ii)
(B) P-> (iv), Q -> (iii), R -> (i), S -> (ii)
(C) P-> (iii), Q -> (iv), R -> (ii), S -> (i)
(D) P-> (iv), Q -> (iii), R -> (ii), S -> (i)
Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.
Learn all GATE CS concepts with Free Live Classes on our youtube channel.
- Tower of Hanoi – Ɵ(2n)
- Heap sort worst case – Ɵ(n log n)
- Binary Search – Ɵ(log n)
- Addition of two nxn matrices – Ɵ (n2)
Therefore Option (C) is correct