Given a number, the task is to write a recursive function which checks if the given number is palindrome or not.
Input : 121 Output : yes Input : 532 Output : no
The approach for writing the function is to call the function recursively till the number is completely traversed from the back. Use a temp variable to store the reverse of the number according to the formula which has been obtained in this post. Pass the temp variable in the parameter and once the base case of n==0 is achieved, return temp which stores the reverse of a number.
Below is the implementation of the above approach:
- Recursive function to check if a string is palindrome
- Program to check the number is Palindrome or not
- Bash program to check if the Number is a Palindrome
- C Program to Check if a Given String is Palindrome
- Program to check if an Array is Palindrome or not
- Program to check if an Array is Palindrome or not using STL in C++
- Java program to check whether a string is a Palindrome
- Program to check if an array is palindrome or not using Recursion
- Check if a number is magic (Recursive sum of digits is 1)
- Java program to check palindrome (using library methods)
- TCP Client-Server Program to Check if a Given String is Palindrome
- Python program to check if given string is vowel Palindrome
- Recursive program for prime number
- Check if a number is Palindrome
- Check if a number is Palindrome in PL/SQL
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.