AP® Computer Science A glossary
Recursive call
Course: AP® Computer Science A Shows up in: Unit 4: Data Collections
A call in which a method calls itself, usually with parameter values that move closer to the base case.
Appears in the course and exam description (CED): 4.16.A.14.16.A.2
A recursive method contains at least one recursive call. The calling method pauses until the call returns. Code before the recursive call runs on the way down; code after it runs on the way back up, in reverse order.
Example
return n * factorial(n - 1); // recursive call with a smaller n