LIVE Course for free

Rated by 1 million+ students
Get app now
0 votes
in Computer by (71.8k points)

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)

Please log in or register to answer this question.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.