What is wrong with this function to test for palindromes?

Question

I want it to be recursive method. I think my base case is screwed up.

public static boolean palin(String str){
int begIndex = 0; //begining index
int endIndex = str.length() - 1; //ending index


if(str.length() <= 0)
return true;
else if(str.charAt(begIndex) == str.charAt(endIndex)){

str = str.substring(begIndex + 1, endIndex);

palin(str);
}

return false;


}

Answer 1

You may be incrementing the begIndex, but you're not decrementing the endIndex.

Answer 2

When you use recursive functions, your return value goes to the line:

palin(str);

Unfortunately, you are not doing anything with that value. You should "return palin(str); " then it will make the true go all the way back.

Good luck mate.