Using recursion to find a character in a string

Question

I am trying to find the first occurrence of a letter in a string. For example, p in apple should return 1. Here is what I have:

// Returns the index of the          


        

Answer 1

I'll give you some hints:

1. When you've found the letter, you don't need to recurse further. Additionally, think about what you should be returning in this case.
2. When do you recurse, also think about what the function should return.
3. Is there anything special you need to do if the recursive call returns -1?