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

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

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

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

Attempted by 8 students.

Show answer

Correct answer: A

The worked solution is available to enrolled students.

Explore the full course: Bihar Stet Paper Ii Computer Science