The recurrence equation T(n) = T(n/2) + T(n/3) + n represents the time…

Bihar STET 2025Modified — slightly modified from the official paper; see the solution

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

  1. A.

    Divide and Conquer

  2. B.

    Dynamic Programming

  3. C.

    Greedy Algorithms

  4. D.

    Backtracking

Attempted by 798 students.

Sign up free to check your answer

Sign up free

Explore the full course: Up Lt Grade Assistant Teacher 2025

Loading lesson…