Program to check palindrome using recursion?

Answer 1

#include <stdio.h>

#include <conio.h>

void main()

{

int num,rev=0,m,r;

clrscr();

printf("enter any number");

scanf("%d",&num);

m=num;

while(num>0)

{

r=num%10;

rev=rev*10+r;

num=num/10;

}

if(rev==m)

printf("given number is palindrome");

else

printf("given number is not palindrome");

getch();

}

this is the answer.

Answer 2

Note: The following is pseudo-code (I tried to make it as close to code as possible)

Because there are so many programming languages it would not be good to answer

this question with one language. So, you should be able to take this pseudo-code and

finish it in your language. This is very close to C.

integer palindrome(char[] string)

{

if (length(string) 0) /* we are looking at the last 2 characters

return 1 (true)

palindrome(newstring[]); /* Call palindrome again with two less characters */

}

return 0 (false)

}