Aspire Faculty ID #12680 · Topic: JECA MCA 2024 · Just now
JECA MCA 2024

Which of the given statement is the correct recurrence for the worst case of Binary Search?

Solution

Solution: Binary search recurrence is T(n) = T(n/2) + O(1). Base case T(1)=O(1).
Answer: (C) T(n) = T(n/2) + O(1)

Previous 10 Questions — JECA MCA 2024

Nearest first

Next 10 Questions — JECA MCA 2024

Ascending by ID
Ask Your Question or Put Your Review.

loading...