About recursion palindrome

[Leegt94]

In my function palindrome, i just successful to compare 1st char and last char only..
How do i compare the second char which is(A) and second last char which is (a)??

 #include <ctype.h>
using namespace std;

int palindrome(char *p1, char *p2){

 if ((tolower(*p1) == tolower(*p2)))
    return true;

  else
    return false;
}

int main(){

char str[] = "MAdam";

int palindrome(char *p1, char *p2);

   if(palindrome(str, str+strlen(str)-1))
     cout << str << " is a palindrome" << endl;

   else
     cout << str << " is not a palindrome" << endl;

return 0;
}

[AbstractionAnon]

You never actually make a recursive call.
To be recursive, palindrome must call itself.

int palindrome (char *p1, char *p2)
{   if (tolower(*p1) != tolower(*p2))
        return false;  // Not a palindrome
    return palindrome (p1+1, p2-1);  // check next pair of characters
}

Line 17: function prototypes should normally be in the global scope, not local scope. In this case, you don't need line 17 at all since palindrome precedes main().