how would I reimplement this code to be recursive?

Question

Possible Duplicate:
creating a recursive method for Palindrome In java

This is my code that I have written.

public boolean checkPalindrome(string word){

for(int i=0 ; i < word.length()/2;i++)
{
  if(word.charAt(i) ! = word.charAt(word.length()-1-i))

      return false;
}

return true;
}

The purpose of this method to check if a given string is a palindrome.

This is homework, right? Please edit to add a "homework" tag. — Sergey Kalinichenko, Mar 14 '12 at 06:38
call the method number of times you are calling the for loop as the an example posted in the question asked by you about recursion — Abhishek Choudhary, Mar 14 '12 at 06:38
You posted 4 questions in the last hour. Looks like you want to rewrite your code without doing it yourself. — juergen d, Mar 14 '12 at 06:39

score 1 · Answer 1 · answered Mar 14 '12 at 06:39

1

Hint: change function signature to boolean checkPalindrome(String word, int index);

answered Mar 14 '12 at 06:39

IProblemFactory

9,551
8
50
66

score 1 · Answer 2 · answered Mar 14 '12 at 16:38

1

If you had a function that could check whether a sub-string of your word is a palindrome, would that help you check whether your main word was also a palindrome?

answered Mar 14 '12 at 16:38

Sam I am says Reinstate Monica

30,851
12
72
100

how would I reimplement this code to be recursive?

2 Answers2