Computer Sciences > GATE 2024 SET-1 > Recurrence Relations

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Consider the following recurrence relation:

Which one of the following options is CORRECT?

A

T(n) = Θ(n log log n)

B

T(n) = Θ(n log n)

C

T(n) = Θ(n² log n)

D

T(n) = Θ(n² log log n)

Check Answer

Explanation

Correct : a

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