Palindrome

Input   An integer  
Output  Palindrome or not  
complexity  O(d).(number of digit)  
  
Palindrome(n)  
1.  [initialize segment variables]m := n, i:=n.  
2.  Repeat while(m>0)  
Set i:=i%10;  
 rev:=i+rev*10;  
 m:=m/10 ;  
 i:=m;  
3.  if(rev==n)then print : “Number is palindrome".  
4.  Else print: “Number is not a palindrome".  
5.  Exit  

#include<stdio.h>
#include<conio.h>
int main()  
{  
  int n,d,rev=0,num;  
  printf("enter any integer number  :");  
  scanf("%d",&n);  
  num=n;  
  while(n>0)  
  {  
            d=n%10;  
            rev=rev*10+d;  
            n=n/10;  
  }  
  if(rev==num)  
  {  
              printf("number is palindrome");  
  }          
  else  
     printf("number is not palindrome");  
  return 0;  
}