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?
- A.
Divide and Conquer
- B.
Greedy Algorithms
- C.
Dynamic Programming
- D.
Brute Force
Attempted by 556 students.
Sign up free to check your answer
Sign up freeLoading lesson…

