Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
If a recursive function splits the problem into 2 subproblems of size n/2, the complexity is generally:
O(n)
O(log n)
O(2ⁿ)
O(n log n)
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!