Computer Sciences > GATE 2024 Set-2 > Recurrence Relations
Let T(n) be the recurrence relation defined as follows:
T(0) = 1,
T(1) = 2, and
T(n) = 5T(n-1) - 6T(n-2) for n ≥ 2
Which one of the following statements is TRUE?
T(0) = 1,
T(1) = 2, and
T(n) = 5T(n-1) - 6T(n-2) for n ≥ 2
Which one of the following statements is TRUE?
Explanation
Correct : c
Similar Questions
What is the worst-case time complexity of insertion in an AVL tree?
Which operations on a binary search tree have O(h) complexity?
Compare search complexities of sorted array vs balanced BST.