Which of the following can be recurrence relation(s) corresponding to an…

PYQ GATE 2026

Which of the following can be recurrence relation(s) corresponding to an algorithm with time complexity Θ(n)?

  1. A.

    T(n)=T(n−1)+1 𝑇(1) = 1

  2. B.

    T(n)=2T(n/2)+1 𝑇(1) = 1

  3. C.

    T(n)=2T(n/2)+n 𝑇(1) = 1

  4. D.

    T(n)=T(n−1)+n 𝑇(1) = 1

Attempted by 88 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…