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

Bihar STET · PGT (Paper 2) · Computer Science · 2025

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

A.
Divide and Conquer
B.
Dynamic Programming
C.
Greedy Algorithms
D.
Backtracking

Attempted by 106 students.

Show answer

Correct answer: A

The worked solution is available to enrolled students.

Explore the full course: Bihar Stet Paper Ii Computer Science