The recurrence equation T(n) = T(n/2) + 1 represents the time complexity of…

Bihar STET 2024Bihar STET 2023

The recurrence equation T(n) = T(n/2) + 1 represents the time complexity of which algorithmic paradigm?

  1. A.

    Divide and Conquer

  2. B.

    Greedy Algorithms

  3. C.

    Dynamic Programming

  4. D.

    Brute Force

Attempted by 556 students.

Sign up free to check your answer

Sign up free

Explore the full course: Up Lt Grade Assistant Teacher 2025

Loading lesson…