Recursive program to check if number is palindrome or not

Given a number, the task is to write a recursive function which checks if the given number is palindrome or not.

Examples:

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:

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// Recursive C++ program to check if the
// number is palindrome or not
#include <bits/stdc++.h>
using namespace std;
  
// recursive function that returns the reverse of digits
int rev(int n, int temp)
{
    // base case
    if (n == 0)
        return temp;
  
    // stores the reverse of a number
    temp = (temp * 10) + (n % 10);
  
    return rev(n / 10, temp);
}
  
// Driver Code
int main()
{
  
    int n = 121;
      
    int temp = rev(n, 0);
    
    if (temp == n)
        cout << "yes" << endl;
    else
        cout << "no" << endl;
    return 0;
}

chevron_right






                        filter_none









Java














                                    filter_none




                                    edit

                                    close




                                    play_arrow




                                    link

                                    brightness_4

                                    code
                                




















// Recursive Java program to  


// check if the number is  


// palindrome or not 


import java.io.*; 


  


class GFG 


{ 


  


// recursive function that  


// returns the reverse of digits 


static int rev(int n, int temp) 


{ 


    // base case 


    if (n == 0) 


        return temp; 


  


    // stores the reverse 


    // of a number 


    temp = (temp * 10) + (n % 10); 


  


    return rev(n / 10, temp); 


} 


  


// Driver Code 


public static void main (String[] args)  


{ 


    int n = 121; 


    int temp = rev(n, 0); 


      


    if (temp == n) 


        System.out.println("yes"); 


    else


        System.out.println("no" ); 


} 


} 


  


// This code is contributed by anuj_67. 



















                        chevron_right







                        filter_none









Python3














                                    filter_none




                                    edit

                                    close




                                    play_arrow




                                    link

                                    brightness_4

                                    code
                                




















# Recursive Python3 program to check  


# if the number is palindrome or not  


  


# Recursive function that returns 


# the reverse of digits  


def rev(n, temp):  


  


    # base case  


    if (n == 0):  


        return temp;  


  


    # stores the reverse of a number  


    temp = (temp * 10) + (n % 10);  


  


    return rev(n / 10, temp);  


  


# Driver Code  


n = 121;  


temp = rev(n, 0);  


  


if (temp != n):  


    print("yes");  


else: 


    print("no");  


  


# This code is contributed  


# by mits 



















                        chevron_right







                        filter_none









C#














                                    filter_none




                                    edit

                                    close




                                    play_arrow




                                    link

                                    brightness_4

                                    code
                                




















// Recursive C# program to  


// check if the number is  


// palindrome or not 


using System; 


  


class GFG 


{ 


  


// recursive function  


// that returns the 


// reverse of digits 


static int rev(int n,  


               int temp) 


{ 


    // base case 


    if (n == 0) 


        return temp; 


  


    // stores the reverse 


    // of a number 


    temp = (temp * 10) + 


               (n % 10); 


  


    return rev(n / 10, temp); 


} 


  


// Driver Code 


public static void Main ()  


{ 


    int n = 121; 


    int temp = rev(n, 0); 


      


    if (temp == n) 


        Console.WriteLine("yes"); 


    else


        Console.WriteLine("no" ); 


} 


} 


  


// This code is contributed 


// by anuj_67. 



















                        chevron_right







                        filter_none









PHP














                                    filter_none




                                    edit

                                    close




                                    play_arrow




                                    link

                                    brightness_4

                                    code
                                




















<?php 


// Recursive PHP program to check  


// if the number is palindrome or not  


  


// Recursive function that returns 


// the reverse of digits  


function rev($n, $temp)  


{  


    // base case  


    if ($n == 0)  


        return $temp;  


  


    // stores the reverse of a number  


    $temp = ($temp * 10) + ($n % 10);  


  


    return rev($n / 10, $temp);  


}  


  


// Driver Code  


$n = 121;  


$temp = rev($n, 0);  


  


if ($temp != $n)  


    echo "yes";  


else


    echo "no";  


  


// This code is contributed  


// by Sach_Code 


?> 



















                        chevron_right







                        filter_none











Output:


yes







Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.





    

        My Personal Notes
        arrow_drop_up
    

    

        
        

            
            
        

    


Recommended Posts:
RohanDeoli
Check out this Author's contributed articles.
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.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.


Improved By :  vt_m, Sach_Code, Mithun Kumar