Question

This is a simple recursive palindrome test that works in itself but returns 0 regardless of what the function actually returns. Here’s my code, I left in debugging cout statements so you can see that it does indeed work:

bool pal(int l, int r, char *a)
{
     if(l >= r)
     {
        cout << "returning true" << endl;
        return true;
     }

     if(a[l] != a[r])
     {
        cout << "returning false" << endl;
        return false;
     }
     pal(l+1, r-1, a);
}

Answer 1

Your program has undefined behavior because there is a path that does not return at all. You should add a return statement at the end:

return pal(l+1, r-1, a);