Gate CS-2016-2 Question Paper With Solutions

Q. 49 The given diagram shows the flowchart for a recursive function A(n). Assume that all statements, except for the recursive calls, have O(1) time complexity. If the worst case time complexity of this function is O(n^α), then the least possible value (accurate up to two decimal positions) of α is __________

(A) 2.2 to 2.4

(B) 3.2 to 3.4

(C) 0 to 1.8

(D) 1

Answer: (A)

Explanation: