Thread: to check whether a number is palindrome or not?

hello!could not find the mistake in this program....please help!

Code:

//cpp program to check whether a number is palindrome or not
#include<iostream.h>
#include<conio.h>
//the class
class palindrome
{
	  public:
	  int a[20];
	  int n;
	  int num;
	  int compare(int [],int);
};
//function to compare the same array from backwards and from forward direction
//if the comparison yields both the arrays to be same then return 1 else
//return 0
int palindrome::compare(int a[],int n)
{
	  int flag;
	  for(int i=0,j=n-1;i<n/2;i++,j--)
	  {
			 if(a[i]==a[j])
			 {
					flag=1;
			 }
			 else
			 {
					flag=0;
			 {
	  }
	  return(flag);
}
void main()
{
	  palindrome p1;
	  cout<<"\n Enter number";
	  cin>>p1.num;
	  int r;
	  int i=0;
	  //code to place the digits of the number into an array
	  while(p1.num>0)
	  {
			  r=p1.num%10;
			  p1.a[i++]=r;
			  p1.num/=10;
	  }
	  p1.n=i;
	  if(p1.compare(p1.a,p1.n)==1)cout<<"\n Number is palindrome";
	  else cout<<"\n Number is not palindrome";
	  getch();
}

In the method intpalindrome::compare(inta[],intn),

else
{
flag=0;
{


This leads the sytax error. Also, when ever condition matches then exit the loop.

thanks a lot for all your help!!

Why force the digits into an array though when you can do the comparison all at one time? You can grab the # digits using logarithms, and you know that you can pop digits off the least significant side by using modulus and division, why not combine the two and meet halfway?