Modify the attached c++ file , so that the program finds the number of times the isPalindrome function is called. (Hint: Use a global variable and increment it every time the function is called.) #include #include using namespace std;bool isPalindrome(const string& s){if (s.size() <= 1) // Base casereturn true;else if (s[0] != s[s.size() - 1]) // Base casereturn false;elsereturn ispalindrome (s.substr(1, s.size() -2));}int main(){}cout << "Enter a string: ";string s;getline(cin, s);if (isPalindrome(s))cout << s << " is a palindrome << endl;elsecout << s << " is not a palindrome" << endl;return 0;22OMacBook Pro2A

The C++ code is given below with output screenshot

Answered: Modify the attached c++ file , so that…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Modify the attached c++ file , so that the program finds the number of times the isPalindrome function is called.
(Hint: Use a global variable and increment it every time the function is called.)

#include <iostream>
#include <string>
using namespace std;
bool isPalindrome(const string& s)
{
if (s.size() <= 1) // Base case
return true;
else if (s[0] != s[s.size() - 1]) // Base case
return false;
else
return ispalindrome (s.substr(1, s.size() -2));
}
int main()
{
}
cout << "Enter a string: ";
string s;
getline(cin, s);
if (isPalindrome(s))
cout << s << " is a palindrome << endl;
else
cout << s << " is not a palindrome" << endl;
return 0;
22
O
MacBook Pro
2
A

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions