Computer Sciences > GATE 2021 SET-1 > Analysis of Algorithms
Consider the following recurrence relation.
T(n) = T(n/2) + T(2n/5) + 7n if n > 0
T(n) = 1 if n = 0
Which one of the following options is correct?
A
T(n) = Θ(n5/2)
B
T(n) = Θ(n log n)
C
T(n) = Θ(n)
D
T(n) = Θ((log n)5/2)

Explanation

Correct : c

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science