Which of the following is the time complexity of a recursive algorithm that divi...

✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.

Which of the following is the time complexity of a recursive algorithm that divides the input size by half in each step?

O(1)

0%

O

0%

O(log n)

0%

O(n^2)

0%

Want instant access to all verified answers on lms2.ai.saveetha.in?

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!

Add to Chrome