Question: When defining a recursive function, what are possible causes for infinite recursion?
Instructor answer: If the recursion step is defined incorrectly, or if the base case is not included.

Student answer: A base case that is the simplest case for a problem so that the function will lead to it, if this does not happen then it will end up as an infinite loop. And a condition to know when to terminate.
Score (0-5): 5

Student answer: badly designed algorithyms. using recursion for a non recursive problem.
Score (0-5): 2.5

Student answer: Infinite recursion can occur when the base case is omitted or the recursion step is written incorrectly so that it never converges on the base case.
Score (0-5): 5

Student answer: Infinite recursion is an infinite loop if the condition is not met.  Either omitting the base case, or writing the recursion step incorrectly so that it does not converge on the base case causes "indefinite" recursion, eventually exhausting memory.
Score (0-5): 5

Student answer: Either omitting the base case or writing the recursion step incorrectly so that it does not converge on the base case can cause an infinite recursion.
Score (0-5): 5

Student answer: Not having a base case that returns a base value.
Score (0-5): 4

Student answer: Incorrect or missing base case. Must reduce to the base case. The function must get simpler each time it is run (converge to the base case).
Score (0-5): 5

Student answer: no base case<br>no change in values.
Score (0-5): 4.5

Student answer: If at each recursive call the problem does not diminish or if it does not diminish to a base case, can cause infinite recursion.
Score (0-5): 5

Student answer: Omitting the base case or incorrectly calling the recursive step.
Score (0-5): 5

Student answer: The recursive problem cannot be reduced to reach the base case.
Score (0-5): 4.5

Student answer: Lack of defining a base case, or writing the recursion step incorrectly so that it does not converge on the base case
Score (0-5): 5

Student answer: Not having the proper case to leave the recursion
Score (0-5): 4

Student answer: no base case, or the recursive calls do not converge to the base case
Score (0-5): 5

Student answer: No base case, or an incorrectly written recursion step that does not converge on the base case will lead to infinite recursion.
Score (0-5): 5

Student answer: If the recursion function never reaches or successfully defines the base case it will recurse forever.<br><br>This happens many ways, such as the function doesn't progress towards the base case, or the function is coded poorly and doesn't even contain a base case.
Score (0-5): 5

Student answer: <br>not creating a base case, or in the case where the base case will never be met.
Score (0-5): 5

Student answer: improper handling of cases such that not all possible values are able to be handled.
Score (0-5): 3.5

Student answer: There is no base case.<br>The recursion step doesn't reduce the problem during each recursive call.
Score (0-5): 4.5

Student answer: no base case, as in a single return that does not include calling the function again.  a static value to end at.
Score (0-5): 3.5

Student answer: Either omitting the base case, or writing the recursion step incorrectly so the it does not reach the base case can cause infinite recursion.
Score (0-5): 5

Student answer: omitting the base case or writing the recursive call so that it does not converge upon the base case.
Score (0-5): 5

Student answer: Either omitting the base case, or writing the recursion step incorrectly so that it does not converge on the base case
Score (0-5): 5

Student answer: Infinite recursion may occur if no base case is defined or if the call is not varied.
Score (0-5): 4.5

Student answer: Not having a base case, or building a recursion process that doesn't converge on the base case.
Score (0-5): 5

Student answer: Either omitting the base case, or writing the recursion step incorerectly
Score (0-5): 5

Student answer: no base case<br>or if the programmar does not define the base case as the simplest case and it never gets reached
Score (0-5): 5

Student answer: No easily reached base case and no base case at all
Score (0-5): 5

Student answer: function is never allowed to reach the 'base case'
Score (0-5): 5

Student answer: it has no base case, or the base case is never met
Score (0-5): 5

Student answer: recursion refers to situations in which functions call themselves. These types of functions are known as recursive functions. That being said Infinite recursion occurs when the function is designed in such a way as to call it self forever without stopping possible causes
Score (0-5): 3