1. Write a recursive method that displays a given message n times.
2. Write a recursive method that finds the number of occurrences of a specified letter in a given string.
3. Define a recursive method f that, given a nonnegative integer n, returns
• n % 2 when n ranges from 0 to 9
• f(n / 10) + (n % 10) % 2 when n is greater than or equal to 10
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here