C++ Data Structures and Algorithms

Detecting whether a word is a palindrome

A palindrome is a string, or sequence of characters, that has the exact same spelling both forward and backward. NOON, MADAM, RADAR, and ROTATOR are some examples of the palindrome. Similar to the anagram, we can also construct a palindrome from more than one word; for instance, A NUT FOR A JAR OF TUNA, or NO LEMON NO MELON.

To check if a string is palindrome, we have to compare each pair of characters, left character and right character, starting from the most left and the most right character, then moving to the middle. Please see the following diagram:

Using the word ROTATOR, as we can see in the ...