Braineos
Discover
My decks
Challenges
Sign in
← Back to decks
Sign in to save your progress, vote, and build your own decks.Sign in

recursive

cpp

16 cards·by bubblesort1
Study this deck
1. There can be more than one stopping case in a recursive function.
ANSWER: TRUE
2. You may have at most 1 recursive call in a recursive function.
ANSWER: FALSE
3. Recursive functions must return a value.
ANSWER: FALSE
4. The operating system uses a stack to control recursion.
ANSWER: TRUE
1. There can be more than one stopping case in a recursive function.
ANSWER: TRUE
2. You may have at most 1 recursive call in a recursive function.
ANSWER: FALSE
3. Recursive functions must return a value.
ANSWER: FALSE
4. The operating system uses a stack to control recursion.
ANSWER: TRUE
1. There can be more than one stopping case in a recursive function.
ANSWER: TRUE
2. You may have at most 1 recursive call in a recursive function.
ANSWER: FALSE
3. Recursive functions must return a value.
ANSWER: FALSE
4. The operating system uses a stack to control recursion.
ANSWER: TRUE
1. There can be more than one stopping case in a recursive function.
ANSWER: TRUE
2. You may have at most 1 recursive call in a recursive function.
ANSWER: FALSE
3. Recursive functions must return a value.
ANSWER: FALSE
4. The operating system uses a stack to control recursion.
ANSWER: TRUE