Anshul
BAN USERint* palindrome(int n, int l)
{
int j=0,k[l];
for(;j<l;j++)
{
k[j]=(n%10);
n=n/10;
}
if(l%2==0)
{
if(k[(l/2)]>k[(l/2)-1])
{
for(j=0;j<l/2;j++)
{
k[j]=k[l-j-1];
}
}
else
{
k[(l/2)]++;
for(j=0;j<l/2;j++)
{
k[j]=k[l-j-1];
}
}
}
else
{
if(k[(l/2)]>k[(l/2)-1])
{
for(j=0;j<l/2;j++)
{
k[j]=k[l-j-1];
}
}
else
{
k[(l/2)]++;
for(j=0;j<l/2;j++)
{
k[j]=k[l-j-1];
}
}
}
for(j=0;j<l;j++)
{
printf(" %d ",k[j]);
}
return k;
}
struct node * sum(struct node*head1,struct node* head2)
{
int a=0,b=0,count=1,sum,no;
struct node* mover1=head1;
struct node* mover2=head2, *result=NULL,*hr;
while(mover1!=NULL)
{
a+=(mover1->info)*count;
count=count*10;
mover1=mover1->next;
}printf("%d ",a);
count=1;
while(mover2!=NULL)
{
b+=(mover2->info)*count;
count=count*10;
mover2=mover2->next;
}
printf("%d ",b);
sum=a+b;
while(sum!=0)
{
no=sum%10;
sum=sum/10;
if(result==NULL)
{printf("hello");
result=insert(no,NULL);
printf(".....%d..",no);
}
else
{
insert(no,result);
}
}
return result;
}
struct node* intersection(struct node* head, struct node* head1)
{
struct node *mover1, *mover2,*result=NULL,*p,*mr;
mover1=head;
mover2=head1;
while(mover1!=NULL)
{ mover2=head1;
while(mover2!=NULL)
{
if((mover1->info)==(mover2->info))
{
printf("%d\n",mover1->info);
p=(struct node*)malloc(sizeof(struct node));
p->info=mover1->info;
p->next=NULL;
if(result==NULL)
{
mr=p;
result=mr;
}
else
{
mr->next=p;
mr=p;
//printf("%d",mr->info);
}
}
mover2=mover2->next;
}
mover1=mover1->next;
}
display(result);
}
RepRebecaMoore, Consultant at AMD
I am working as an art teacher with “Glory High School,” and develop interests for art and creative expression in ...
can u xplain what is the Q...
- Anshul October 09, 2012