What is the worst-case number of arithmetic operations performed by recursive…
What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size n?
- A.
θ(n)
- B.
θ(√n)
- C.
θ(log2(n))
- D.
θ(n2)
Attempted by 41 students.
Sign up free to check your answer
Sign up freeLoading lesson…