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 ________.
Flow chart for Recursive Function A(n).
The recurrence relation that arises in relation with the complexity of binary search is:
1 Crore+ students have signed up on EduRev. Have you? Download the App 
The recurrence relation
has the solution T (n) equal to
Let
T(n) be the function defined by
Which of the following statements is true?
The running time of the following algorithm
Procedure A(n)
If n<=2 return (1) else return
is best described by:
Consider a list of recursive algorithms and a list of recurrence relations as shown below. Each recurrence relation corresponds to exactly one algorithm and is used to derive the time complexity of the algorithm.
Which of the following is the correct match between the algorithms and their recurrence relations?
Let T(N) be a function defined by the recurrence
Which of the following statements is TRUE?
55 docs215 tests

Test: Recurrence & Searching 2 Test  15 ques 
Test: Asymptotic Worst Case Time & Space Complexity 1 Test  20 ques 
Test: Asymptotic Worst Case Time & Space Complexity 2 Test  20 ques 
Test: Asymptotic Worst Case Time & Space Complexity 3 Test  20 ques 
Test: Asymptotic Worst Case Time & Space Complexity 4 Test  20 ques 
55 docs215 tests

Test: Recurrence & Searching 2 Test  15 ques 
Test: Asymptotic Worst Case Time & Space Complexity 1 Test  20 ques 
Test: Asymptotic Worst Case Time & Space Complexity 2 Test  20 ques 
Test: Asymptotic Worst Case Time & Space Complexity 3 Test  20 ques 
Test: Asymptotic Worst Case Time & Space Complexity 4 Test  20 ques 