palindrome recursive

[bst]

I need to write a program for a palindrome using recursive functions and this is what I got so far but the problem is that my code only works if its a word not a sentence, what can I do?

#include <iostream>
#include <string>
using namespace std;

bool Test(string sentence,int first,int last);
bool Test(string sentence,int first,int last)
{

if (last<=1)
return true;
else
if (sentence[first]==sentence[last-1])
return Test(sentence,first+1,last-1);

else return false;
}

int main()
{
string sentance;
getline (cin, sentance);
int last=sentance.length();

Test(sentance,0,last);
if (Test(sentance,0,last))
cout<<"It is a Palindrome"<<endl;
else
cout<<"It is not a palindrome"<<endl;
return 0;
}

[ne555]

first, indent your code.
¿how do you define a palindrome for a sentence? If you want to ignore whitespace and punctuation, the I suggest to create another string where you will copy only the valid characters.
by the way, ¿why do you Test() twice?

[jose23567]

like ne555 said you need to indent your code in order to make it more viable for you to see your mistakes

[jose23567]

so you could declare a string to be able to let you type a sentence.

[woldaker]

I think something like this should work, if you really need to recurse:

bool const Test(char const *chars, int len) {
    return len <= 1 ||
        chars[0] == chars[len - 1] &&
        Test(chars + 1, len - 1);
}

Then call it like this (or make a little wrapper function as I did here):

bool const TestStringForPalindrome(string const &s) {
    return Test(s.c_str(), s.size());
}