For a function to be recursive (and practical in Python), what should it have?

Question

BlackTom AI · Accepted Answer

Let’s break down the question carefully: What features make a function recursive and practical in Python?
Option a: 'Must return a value' — While many recursive functions do return a value, it is not a strict requirement for recursion to be possible. A function could be recursive and perform actions without returning a meaningful value (e.g., returning None or side effects). Therefore this statement is not a necessary condition for recursion itself.
Option b: '1 or more base cases' — This is essential. A base case provides a termination condition so the recursion does not continue indefinitely. Without at least one base case, a recursive function would recurse forever and eventually cause a stack overflow. Hence this is a correct and necessary component.
Option c: '1 or more recursive calls' — Also essential. Recursion by definition involves the function calling itself (directly or indirectly) with a simpler or smaller problem. Without any recursive call, the function wouldn’t be recursive in the technical sense. So this is another correct component.
Option d: 'No loops' — This is not a requirement for recursion. You can have a recursive function that also uses loops, or you can implement recursion without loops. The presence or absence of loops does not determine whether a function is recursive. Therefore this statement is not correct as a defining feature.
Putting it together, the correct characteristics are the presence of base cases and the presence of recursive calls, while the need to return a value is not mandatory, and loops can be used or avoided depending on the implementation.

FIT1008-FIT1054-FIT2085_S2_2025 Week 9 Workshop Quiz

For a function to be recursive (and practical in Python), what should it have?

查看解析

登录即可查看完整答案

类似问题

Which of the following code snippets returns the factorial of a given number? (Hint: Factorial of 5 = 5! = 1 * 2 * 3 * 4 * 5 = 120)

Which of the following code snippets returns the factorial of a given number? (Hint: Factorial of 5 = 5! = 1 * 2 * 3 * 4 * 5 = 120)

What is a base case in recursion?

What will this recursive function print when called with countdown(3)?

Which of the following situations might cause a recursive function to run infinitely?

What will be the output of this recursive function call factorial(4)?

Which best describes recursion?

What will this code output?

更多留学生实用工具

考试浏览器助手

风格化写作助手

论文查重助手

文献引用助手

课堂转译助手

课堂笔记助手

Quiz搜索助手

学校历年真题

智能刷题助手

智能匹配练习

希望你的学习变得更简单