title: A recursive algorithm for palindrome testing
body: <p>This is a normal method for palindrome testing that I made but I need a recursive function that checks if a number is palindrome.</p>
  
  <pre><code>int number, firstnumber, lastnumber, secondnumber, fourthnumber;
  
  readingnumber:
  
  Console.Write("Please enter your palindrome number(5 digits) :" );
  //reading the integer number entered
  number = Int32.Parse(Console.ReadLine());
  //making condition if the number is less than 5 digits
  if (number / 100000 != 0)
      goto readingnumber;
  else
  {
      //we are taking each element alone 
      firstnumber = number / 10000;
      lastnumber = number % 10;
      fourthnumber = (number % 100) / 10;
      secondnumber = (number % 10000) / 1000;
  
      //making if condition to verify if the number is palindrom or not
      if (firstnumber == lastnumber &amp;&amp; secondnumber == fourthnumber)
          Console.WriteLine("\n\nthe number you've enter is palindrom");
      else
          Console.WriteLine("\n\nthe number you've enter is not palindrom");
  
      //end of program
      Console.WriteLine("\n\n\n\t\tPlease enter any key to exit ...");
  }
  
  Console.ReadLine();
  </code></pre>