Assertion: algorithm's application | /r/CapableOf | show this recursion
Facets:
value: to have the solution
type: PURPOSE
Source sentences:
text: Application of the master theorem for divide-and-conquer recurrences shows this recursion to have the solution Θ(n3), the same as the iterative algorithm.