Question

Palindrome Detector

A palindrome is any word, phase, or sentences that reads the same forward and backward. Here are some well-know palindrome. Write a bool function that uses recursion to determine if a string arguments is a palindrome. The function should return true if the argument reads the same forward and backward. Demonstrate the function in a program

Answer 1

Source Code in C++:

#include <iostream>
using namespace std;

bool isPalindrome(string s) //recursive function to check if a string is palindrome or not
{
if(s.length()==0 || s.length()==1) //base case
return true;
else if(s[0]==s[s.length()-1]) //recursive case
return true && isPalindrome(s.substr(1,s.length()-2)); //recursive call
else
return false;
}

int main()
{
//testing the function
string word;
cout << "Enter the word to be checked for palindrome: ";
cin >> word;
if(isPalindrome(word))
cout << word << " is a palindrome" << endl;
else
cout << word << " is not a palindrome" << endl;
return 0;
}

Output:

C.\Users Debjit GDocuments palindrome.exe Enter the word to be checked for palindrone naan maam is a palindrome Process returned 0 <0x0) execut ion time Press any key to continue 2.881 s