Beginner
Discrete Mathematics & Math
Q40 / 100
What is a recurrence relation?
Correct! Well done.
Incorrect.
The correct answer is B) An equation defining a sequence term in terms of previous terms — solved to find closed-form expressions
B
Correct Answer
An equation defining a sequence term in terms of previous terms — solved to find closed-form expressions
Explanation
T(n) = 2T(n/2) + n (merge sort). Solved by Master Theorem: T(n) = O(n log n). Fibonacci: F(n) = F(n-1) + F(n-2) with closed form F(n) = φⁿ/√5 (Binet's formula).
Progress
40/100