Algorithms Time Complexity Matching | GATE CS 2017

Computer Sciences > Gate 2017 Set-2 > Complexity

Match the algorithms with their time complexities:

Algorithm	Time Complexity
(P)Tower of Hanoi with n disks	(i)θ(n²)
(Q)Binary Search given n sorted numbers	(ii)θ(nlogn)
(R)Heap sort of n numbers at the worst case	(iii)θ(2ⁿ)
(S)Addition of two n*n matrices	(iv)θ(logn)

P-> (iii), Q -> (iv), R -> (i), S -> (ii)

P-> (iv), Q -> (iii), R -> (i), S -> (ii)

P-> (iii), Q -> (iv), R -> (ii), S -> (i)

P-> (iv), Q -> (iii), R -> (ii), S -> (i)

Correct : Complexity

Similar Questions