check palindrome in python using recursion
def isPalindrome(string):
#termination condition: the string is one character or less
if (len(string) <= 1):
return True
if (string[0] == string[-1]):
return isPalindrome(string[1:-1])
else:
return Falsereads the string in then determines if the string is a palindrome.
#include <iostream>
using namespace std;
// Iterative function to check if given string is a palindrome or not
bool isPalindrome(string str)
{
int low = 0;
int high = str.length() - 1;
while (low < high)
{
// if mismatch happens
if (str[low] != str[high])
return false;
low++;
high--;
}
return true;
}
int main()
{
string str = "XYXYX";
if (isPalindrome(str))
cout << "Palindrome";
else
cout << "Not Palindrome";
return 0;
}reads the string in then determines if the string is a palindrome.
#include <iostream>
using namespace std;
// Recursive function to check if str[low..high] is a palindrome or not
bool isPalindrome(string str, int low, int high)
{
// base case
if (low >= high)
return true;
// return false if mismatch happens
if (str[low] != str[high])
return false;
// move to next the pair
return isPalindrome(str, low + 1, high - 1);
}
int main()
{
string str = "XYBYBYX";
int len = str.length();
if (isPalindrome(str, 0, len - 1))
cout << "Palindrome";
else
cout << "Not Palindrome";
return 0;
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
