Assertion: recursive function | /r/HasAspect | exponential number of calls
Facets:
Source sentences:
text: An exponential recursive function is one that, if you were to draw out a representation of all the function calls, would have an exponential number of calls in relation to the size of the data set (exponential meaning if there were n elements, there would be O(an) function calls where a is a positive number).