A palindrome is a string that is spelled the same way forward and backward. Some examples of palindromes are "radar", "deed", "sees". The following are also palindromes if you ignore the punctuations and spaces: "a man a plan a canal panama". amanaplanacanalpanama "Madam I'm Adam" ---> madamimadam Notice that in palindromes the first letter matches the last, the second matches the next-to- last, and so on. Write a recursive function that returns a value of 1 if its string argument is a palindrome and zero otherwise. * Note that for the function parameters, you need to accommodate for the shrinking string, so that the string shrinks both from beginning and end after each recursive call. ** Think about the simple cases or base cases. The 2 base cases have conditions that would return O and return 1 independently. For the palindrome, create a driver program. First ask the user to enter any string through the keyboard. Then remove all the spaces and punctuations from the string. Also, remove any letter capitalization from the string. Finally, pass the string to the palindrome function through a function call.

EBK JAVA PROGRAMMING
9th Edition
ISBN:9781337671385
Author:FARRELL
Publisher:FARRELL
Chapter7: Characters, Strings, And The Stringbuilder
Section: Chapter Questions
Problem 4GZ
icon
Related questions
Question

in c

A palindrome is a string that is spelled the same way forward and backward.
Some examples of palindromes are "radar", "deed", "sees".
The following are also palindromes if you ignore the punctuations and spaces:
"a man a plan a canal panama". --->
amanaplanacanalpanama
"Madam I'm Adam"
---> madamimadam
Notice that in palindromes the first letter matches the last, the second matches the next-to-
last, and so on.
Write a recursive function that returns a value of 1 if its string argument is a
palindrome and zero otherwise.
* Note that for the function parameters, you need to accommodate for the shrinking
string, so that the string shrinks both from beginning and end after each recursive call.
** Think about the simple cases or base cases. The 2 base cases have conditions that
would return 0 and return 1 independently.
For the palindrome, create a driver program. First ask the user to enter any
string through the keyboard. Then remove all the spaces and punctuations from the
string. Also, remove any letter capitalization from the string. Finally, pass the string to
the palindrome function through a function call.
Transcribed Image Text:A palindrome is a string that is spelled the same way forward and backward. Some examples of palindromes are "radar", "deed", "sees". The following are also palindromes if you ignore the punctuations and spaces: "a man a plan a canal panama". ---> amanaplanacanalpanama "Madam I'm Adam" ---> madamimadam Notice that in palindromes the first letter matches the last, the second matches the next-to- last, and so on. Write a recursive function that returns a value of 1 if its string argument is a palindrome and zero otherwise. * Note that for the function parameters, you need to accommodate for the shrinking string, so that the string shrinks both from beginning and end after each recursive call. ** Think about the simple cases or base cases. The 2 base cases have conditions that would return 0 and return 1 independently. For the palindrome, create a driver program. First ask the user to enter any string through the keyboard. Then remove all the spaces and punctuations from the string. Also, remove any letter capitalization from the string. Finally, pass the string to the palindrome function through a function call.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Program on Numbers
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
Microsoft Visual C#
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,