Question

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 ________.

Flowchart for Recursive Function A(n)

Answer 1

Correct answer is 2.32