Braineos
Discover
My decks
Challenges
Sign in
← recursive C++
1 / 13
Term
There can be more than one stopping case in a recursive function.
Tap the card to flip
Tap the card above to reveal the answer