I'm reviewing the definition of recursion and in my notes are two questions about a recursive problem. One question asks about the base case, the other one about the small version of the problem, I always get confused about which is which... can you help me to find a way to better understand these concepts?
The examples in the exercise are:
- a function that determines if there is a "x" element in an array
- a function that determines if the string is palindrome or not
- Find the base case
- Find the small version of the problem
- (Implement the recursive solution)