Given the recurrence relation for the worst-case time complexity • T(n) = c,…

MPPSC Assistant Professor 2025

Given the recurrence relation for the worst-case time complexity

• T(n) = c, when n = 1

• T(n) = T(n/2) + c, otherwise

Where c is a constant the recurrences solves to :

T(n) = c[1 + log2n]

What is the worst-case time complexity of this algorithm ?

  1. A.

    Θ(n)

  2. B.

    Θ(log n)

  3. C.

    Θ(n log n)

  4. D.

    Θ(1)

Attempted by 154 students.

Sign up free to check your answer

Sign up free

Explore the full course: Uppsc Polytechnic Lecturer 2025 Cs

Loading lesson…