The given diagram shows the flowchart for a recursive function A(n). Assume…

PYQ LTIMindtree Hiring Assessment 2024

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 (accurate up to two decimal position) of α is _______.

  1. A.

    2.2

  2. B.

    2.9

  3. C.

    8.9

  4. D.

    7.8

Attempted by 85 students.

Sign up free to check your answer

Sign up free

Explore the full course: Cdac C Cat Complete Preparation

Loading lesson…