🚀 go-pugleaf

Hello, Victor.  I'm sure others would propose solutions like using the STL
reverse() algorithm or using strrev() and then stricmp() but I will assume
that you are not allowed to use them yet.  I will work on what you currently
have.  Here is my proposed solution (Warning: untested!):

>int main(int argc, char **argv)
>{
>  int Front;
>  int Back;
>  bool Palindrome = true;        // use built-in boolean data type and
initialize it
                                                     // to true
>  AnsiString InputString;
>    InputString = ReadStringPr("Enter your non-empty string for testing");
>    Front = 0;                               // not 1
>    Back = Length(InputString) - 1  // without the minus one, you will be
                                                              // pointing to
the terminating null character,
                                                             // unless your
Length() function includes
                                                             // it in the
count.
>    while (Front < Back)
>      {
          // as soon as you find a pair that doesn't match,
          // then, you're sure it's not a palindrome
>        if (InputString[Front] != InputString[Back])
          {
>           Palindrome = false;
             break;
          }
>        ++Front;
>        --Back;
>      }
>    if (Palindrome)
>      WriteString("Yes, it is a palindrome");
>    else
>      WriteString("No it is not a palindrome");
>
>    getchar();
>    return 0;
>}

Ever