In computer programming, an algorithm that calls itself is said to be ____.
A) iterative
B) recursive
C) cyclic
D) repetitive
Correct Answer:
Verified
Q21: For complex problems that can be broken
Q22: On a computer, conditional recursion continues until
Q23: A properly structured recursive algorithm should always
Q24: In conditional exponentially recursive algorithms, the recursive
Q25: After reading the specifications for a project,
Q27: A(n) _ is one that uses a
Q28: The term _ is just another name
Q29: The term _ is used to describe
Q30: _ occurs when a method calls itself
Q31: The recursive Sierpinski gasket algorithm is an
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents