Question

Write a function palcheck (char word II) which takes a C-style string word (or a C++ string word if you wish) and returns or false depending on whether or not the string is a palindrome. (A palindrome is a string which reads the same backwards and forwards. Some classic example of palindromes are radar, racecar, toot, deed, bib, civic, redder and madam.) Use your function from part (a) in a complete C++ program which, for each small letter 'a' through 'z', calculates and outputs the length of the longest palindrome in the file which begins with the letter. (Don't worry about ties.) For example, for the very simple input file: bib dad radar dinosaur kayak deed bob did civic madam yay a elephant year Your output should consist of the 26 lines: maximal length of palindromes beginning with a = 1 maximal length of palindromes beginning with b = 3 maximal length of palindromes beginning with c = 5 maximal length of palindromes beginning with d = 4 maximal length of palindromes beginning with e = 0 maximal length of palindromes beginning with f = 0 maximal length of palindromes beginning with y = 3 maximal length of palindromes beginning with z = 0 (continued)

Answer 1

Compile Execute >Share Code main.cpp x 1 #include<iostream> #include(algorithm» #include<string.h> #include-fstream» 4 6 using namespace std; 7 void palendrome(string, string); 9 int main() string 1ine-"", line_rev-""; ifstream infile; 12 13 14 15 16 17 18 19 infile.open("C:/Users/sreenu/Desktop/palendrome.txt"); infile>line; line rev-line reverse(line rev.begin), line rev.end) 21 23 25 return e; palendrome (line, line_rev); while(getline(infile, line)); 27 void palendrome (string org, string rev) 28 29 if(org-rev) 31 32 cout<<org<<endl;

I mentioned above code for Question (a).