Select the description below which does NOT accurately characterise how computational recursion works.
Recursion is the repeated application of a self-referencing function or procedure.
Recursion decomposes a problem into increasingly smaller instances of the same problem.
Recursion must eventually reach a base case in order to stop making further recursive calls.
Recursion must aggregate results returned from recursive calls to form a solution.

Multiple Choice1 MarkPremium
0 Uses2 Views1 Like
Login or Create an Account to view the mark scheme, comment, and add to a test