Algorithms | Analysis of Algorithms | Question 16
Consider the following three claims:
I where k and m are constants
II
III 2^{2n+1} = O(2^n)
Which of these claims is correct? (GATE CS 2003)
(A)
I and II
(B)
I and III
(C)
II and III
(D)
I, II and III
Answer: (A)
Explanation:
(I) (n+m)k = nk + c1*n(k-1) + ... km =(nk) (II) 2(n+1) = 2*2n = O(2n)
Quiz of this Question
Please comment below if you find anything wrong in the above post
Please Login to comment...