9.1: Recursive Palindrome

A string is a palindrome if it is identical forward and backward. For example “anna”, “civic”, “level” and “hannah” are all examples of palindromes. Write a recursive function that determines whether or not a string passed as a parameter is a palindrome.

Assume the empty string is a palindrome, as is any string containing only one character. Any longer string is a palindrome of its first and last characters match, and if the string formed by removing the first and last characters is also a palindrome.

Write a main program that prompts the user to enter a string. Use your recursive function to determine whether or not it's a palindrome, and print an appropriate message.

def isPalindrome(s):

    if len(s) <= 1:
        return True

    return s[0] == s[-1] and isPalindrome(s[1:len(s)-1])

def main():
    line = input("Enter a string: ")

    if isPalindrome(line):
        print("That was a palindrome")
    else:
        print("That was not a palindrome")

main()