All changes
1 answer:
You might be interested in
Answer:
Explanation:
The following code is written in Python. It is a recursive function that tests the first and last character of the word and keeps checking to see if each change would create the palindrome. Finally, printing out the minimum number needed to create the palindrome.
import sys
def numOfSwitches(word, start, end):
if (start > end):
return sys.maxsize
if (start == end):
return 0
if (start == end - 1):
if (word[start] == word[end]):
return 0
else:
return 1
if (word[start] == word[end]):
return numOfSwitches(word, start + 1, end - 1)
else:
return (min(numOfSwitches(word, start, end - 1),
numOfSwitches(word, start + 1, end)) + 1)
word = input("Enter a Word: ")
start = 0
end = len(word)-1
print("Number of switches required for palindrome: " + str(numOfSwitches(word, start, end)))
