The given recurrence is a divide and conquer recurrence, and it can be solved using the master theorem. The solution to this recurrence is O(nlogn), as it fits the second case of the master theorem.
Was this answer helpful?
0
0
Top AP PGECET Computer Science & Information Technology Questions