Answers for "find number is a palindrome using recursion"

1

Java program to check palindrome number using recursion

// Java program to check palindrome number using recursion
public class PalindromeNumberRecursion
{
   static int palindromeRecursion(int number, int temp)
   {
      if(number == 0)
         return temp;
      // storing reverse of a number
      temp = (temp * 10) + (number % 10);
      return palindromeRecursion(number / 10, temp);
   }
   public static void main(String[] args)
   {
      int number = 141;
      int temp = palindromeRecursion(number, 0);
      if(temp == number)
      {
         System.out.println("number is palindrome.");
      }
      else
      {
         System.out.println("number is not palindrome.");
      }
   }
}
Posted by: Guest on February-19-2021
0

check whethet a string is palindrome or not using recursion

//C++ Code
#include <bits/stdc++.h>
using namespace std;
bool isPalindrome(string str,int start,int end)
{
    if(start >= end) //base case
    return true;
    else{
        //if mismatch happens false will be returned else true
        return ((str[start] == str[end]) && isPalindrome(str,start+1,end-1));
    }
}
int main()
{
    int length = 5;
    string str = "ABCBA";
    bool ans = isPalindrome(str,0,length-1);
    if(ans == true)
    cout<<"Yes"<<endl;
    else
    cout<<"No"<<endl;
    return 0;
}
Posted by: Guest on July-11-2021

Code answers related to "find number is a palindrome using recursion"

Code answers related to "Java"

Java Answers by Framework

Browse Popular Code Answers by Language