A ______ function is one that calls itself. a. dynamic b. static c. recursive d. data validation e. None of the above
Added by Sheila G.
Close
Step 1
Step 1: A function that calls itself is called a recursive function. Show more…
Show all steps
Your feedback will help us improve your experience
Lien Le and 54 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
select false statement that is listed below ?
Lien L.
The sequence $a_{1}=5, a_{n}=3 a_{n-1}$ is an example of a(n) _____ sequence. (a) alternating (b) recursive (c) Fibonacci (d) summation
Sequences; Induction; the Binomial Theorem
Sequences
Which of the following is not a characteristic of recursive routines? a. They call themselves. b. Each call performs its work on a smaller version of the same problem. c. When a smaller version of the problem is too complex, control passes back to the caller to try a different approach. d. Some versions of the problem don’t require calling the recursive routine.
James K.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD