🚀 go-pugleaf

Victor wrote in message <7eatvr$p1g$1@barcode.tesco.net>...
>I have been asked to design a project to determine whether a word is a
>palindrome or not (btw a plaindrome is a word that is the same backwards ie
>noon).


This is almost a one-liner in C++.  Some time back I posted a solution for
this very problem.  You can easily find it with a search on DejaNews (I
did).  Here it is below:

#include <string>
#include <algorithm>

bool palindrome( std::string &s ) {
  return std::equal( s.begin(), s.begin + s.size()/2, s.rbegin() );
}

This function is case-sensitive, but it is fairly simple to make it
case-insensitive.  I leave that as an excercise.  (Hint:  use the version of
std::equal() that takes a predicate)