Question

Implement a recursive algorithm (implemented in Java) that checks if a number is identical when read both forwards and backwards

Answer 1

// Recursive Java program to check if a number is identical when read both forwards and backwards

import java.util.*; 
import java.io.*; 
  class Identical 
{ 
  
// A recursive function to return the reverse of digits of the number
static int reverse(int num, int temp) 
{ 
    // base case 
    if (num == 0) 
        return temp; 
  
    // to store the reverse  of a number 
    temp = (temp * 10) + (num % 10); 
  
    return reverse(num/ 10, temp); 
} 
  
// Driver Code 
 public static void main(String args[])   
{ 
      int num = 0; 
      Scanner sc = new Scanner(System.in);
      System.out.println("Enter the number");
      num = sc.nextInt();
    int temp = reverse(num, 0); 
      
    if (temp == num) 
    System.out.println("Yes, the number is identical when read both forwards and backwards"); 
    else
    System.out.println("No, the number is not identical when read both forwards and backwards" ); 
} //main()
} //class