Question 9573 – Time-Complexity
February 13, 2024
Question 10528 – Time-Complexity
February 13, 2024
Question 9573 – Time-Complexity
February 13, 2024
Question 10528 – Time-Complexity
February 13, 2024

Question 10668 – Time-Complexity

When n = 22k for some k ≥ 0, the recurrence relation

 T(n) = √(2)T(n/2) + √n, T(1) = 1

evaluates to :

Correct Answer: A

Question 30 Explanation: 
A
√n (log n + 1)
B
√n log n
C
√n log √n
D
n log √n
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!