# The given diagram shows the flowchart for a recursive function A(n). Assume that all statements,

69 views
in Computer

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)

+1 vote
by (70.9k points)