Question: Design a recursive algorithm to determine if a string is a palindrome. A palindrome is a string which is symmetrical. Ex: abba, racecar, civic. Your
Design a recursive algorithm to determine if a string is a palindrome. A palindrome is a string which is symmetrical. Ex: abba, racecar, civic. Your algorithm should take a string as input and return a bool. Then, using Haskell to implement your recursive algorithm for palindrome. Your declaration should be: palindrome :: String -> Bool
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
