testing a word for palindromness(heh)

[Pex]

in c++ would it just be a test between each element in a string? or is there a more obvious way?

 

[Drakkon]

that or make a copy...reverse the copy...then compare the two strings...

 

[notfred]

perl:

if($string eq (reverse $string)){
print "This is a palindrome";
}

 

[Barnaby W. Füi]

python:

if string == string[::-1]:
print "this is a palindrome"

 

[notfred]

Originally posted by: BingBongWongFooey
python:

if string == string[::-1]:
  print "this is a palindrome"

no way in hell you can say that "string[::-1]" is syntactically simpler than "reverse $string"

 

[BFG10K]

Reverse the string and then do a strcmp to see if they match. I think string reversing exists in the string class but I'm not 100% sure.

Failing that, you could use two pointers, on at each end of the string.
Each time the two pointers match, move each of them closer to the centre.
If they both reach the centre or they pass each other, the string is a palindrome.
If they don't match before reaching the centre, it's not a palindrome.