Which of the following can be recurrence relation(s) corresponding to an…
GATE · 2026 · CS · Set 2 · Computer Science & IT
Which of the following can be recurrence relation(s) corresponding to an algorithm with time complexity Θ(n)?
- A.
T(n)=T(n−1)+1 𝑇(1) = 1
- B.
T(n)=2T(n/2)+1 𝑇(1) = 1
- C.
T(n)=2T(n/2)+n 𝑇(1) = 1
- D.
T(n)=T(n−1)+n 𝑇(1) = 1
Attempted by 59 students.
Sign up free to check your answer
Sign up freeLoading lesson…