Question

I been assigned this exercise at college, but I don’t know how to implement the recursion structure ( ” ??? ” in the code ). In the if-cycle I should match the first character in the array with the last and apply the recursion in order to reach the central character, but I don’t know how to setup the code. The main function code compiles perfectly.

#include <iostream>

using namespace std;

const int DIM = 8;

bool is_palindrome (char* first, char* last)
{
    if (first == last)
    {
        ???
    }
    else
     return false;
}

int main()
{
    char a[DIM] = {'i','n','g','e','g','n','i','\0'};
    char *first = &a[DIM] + 1;
    char *last = &a[DIM] -1;

    if (is_palindrome(first, last))
        cout << " the char array is palindrome ";
    else
            cout << " the char array is not palindrome ";

    return 0;
}

Answer 1

using namespace std;

const int DIM = 8;

bool is_palindrome ( char* first , char* last )
{
    if ( *first == '\0' )
    {
        return false;
    }
    else if ( first >= last )
    {
        return true;
    }
    else if ( *first == *last )
    {
        return is_palindrome(first + 1, last - 1);
    }
    else
    {
        return false;
    }
}

int main ()
{
    char a[DIM] = {'i','n','g','e','g','n','i','\0'};
    char *first = a;
    char *last = &a[DIM] - 2;

    if ( is_palindrome ( first , last ) )
    {
        cout << " the char array is palindrome ";
    }
    else
    {
        cout << " the char array is not palindrome ";
    }

    return 0;
}