quick question here, in this recursive function to test a word to see if its a palindrome:
Code:int ispalindrome(char *s, int len) { if (len <=1 ) return 1; else return((s[0] == s[len-1]) && ispalindrome(s+1, len-2)); }
In one case, an integer: 1 is returned. This means the word is too short. How does the other return statment determine whether it's a palindrome or not, and how do I test it in the main?