Concerning the recursive function to find whether a word is a palindrome can anyone give me a tip. I am strugling with the question. What should the base case be in this question? I can't figure it out. Thanks for any help.
The Base case would be different for each implementation of the recursive function, but a good method would be to check the first and last characters of the string to see if they're the same (this will be the general case), if they are, you reduce the amount of characters to test in the next call to the function.