Link list in reverse order.
Answers were Sorted based on User's Feedback
/*
the structure is as follows:
struct node
{
int data;
struct node *next;
}
*/
struct node * reverse (struct node *home , struct node *rev)
{
struct node temp , *p;
if(home != NULL)
{
temp = home;
while(temp != NULL)
{
//this part will create a new node with the name p.
p = myalloc;
p -> data = temp -> data;
p -> next = NULL;
if(rev == NULL)
rev = p;
else
{
p -> next = rev;
rev = p;
}
temp = temp -> next;
}
}
return rev;
}
Is This Answer Correct ? | 5 Yes | 0 No |
Answer / lijun li
#include <stdio.h>
typedef struct list
{
int data;
struct list * next;
} LIST;
LIST* reverse(LIST *head)
{
LIST* temp;
LIST* temp1;
if (head == NULL || head->next == NULL)
return head;
else
{
temp = head->next;
head->next = NULL;
while(temp)
{
temp1 = temp->next;
temp->next = head;
head = temp;
temp = temp1;
}
return head;
}
}
int main(int argc, char ** argv)
{
int i=0;
LIST* head = NULL;
LIST* node = NULL;
int count;
if (argc < 2) printf("usage: a.out <count>");
else count = atoi(argv[1]);
for (i=0;i<count;i++)
{
node = (LIST*)calloc(sizeof(LIST));
node->data = i;
node->next = head;
head = node;
}
node = head;
while(node)
{
printf("before %d\n", node->data);
node = node->next;
}
head = reverse(head);
printf("after head=%d\n", head->data);
node = head;
while(node)
{
printf("after %d\n", node->data);
node = node->next;
}
}
Is This Answer Correct ? | 6 Yes | 1 No |
Answer / shruti
**Liked list as a stack = linked list in reverse order.
/*
the structure is as follows:
struct node
{
int data;
struct node *next;
}
*/
struct node * reverse (struct node *home , struct node *rev)
{
struct node temp , *p;
if(home != NULL)
{
temp = home;
while(temp != NULL)
{
//this part will create a new node with the name p.
p = myalloc;
p -> data = temp -> data;
p -> next = NULL;
if(rev == NULL)
rev = p;
else
{
p -> next = rev;
rev = p;
}
temp = temp -> next;
}
}
return rev;
}
Is This Answer Correct ? | 2 Yes | 0 No |
//Go through the code, incase any issues feel free to
revert.
Copying a link list:
//home is the stationary pointer of the main linked list
which is to be copied.
//head is the stationary pointer of the new linked list
which has to be created..
//temp and temp1 are the moving pointers attached to the
respective linked list...
struct node *copy(struct node *home , struct node *head)
{
struct node *temp , *temp1 , *p;
temp = home;
while(temp != NULL)
{
p = (struct node *) malloc (sizeof(struct node));
p -> data = temp -> data;
if(head == NULL)
head = p;
else
{
temp1 = head;
while(temp1 -> next != NULL)
temp1 = temp1 -> next;
temp1 -> next = p;
}
temp = temp -> next;
}
return head;
}
Is This Answer Correct ? | 1 Yes | 0 No |
Answer / ashitosh
node *reverse(node *head)
{ node *p,*q,*r;
p=NULL;
q=head;
r=q->next;
while(q!=NULL)
{
q->next=p;
p=q;
q=r;
if(q!=NULL)
r=q->next;
}
return(p);
}
Is This Answer Correct ? | 1 Yes | 0 No |
Answer / raghuram.a
node *reverse(node *first)
{
node *cur,*temp;
cur=NULL;
while(first!=NULL)
{temp=first;
first=first->link;
temp->link=cur;
cur=temp;
}
return cur;
}
Is This Answer Correct ? | 5 Yes | 5 No |
Answer / aqib
write a link list program to insert integer number and then
display its sum as well. Your program should display the
address as well as the result
write a program to reverse a link list so that the last
element becomes the first one and so on
copy one link list to another list
Is This Answer Correct ? | 0 Yes | 2 No |
Answer / sameera.adusumilli
recursive reverse(ptr)
if(ptr->next==NULL)
return ptr;
temp=reverse(ptr->next);
ptr=ptr->next;
return ptr;
end
Is This Answer Correct ? | 3 Yes | 8 No |
main() { char i=0; for(;i>=0;i++) ; printf("%d\n",i); }
Give a very good method to count the number of ones in a 32 bit number. (caution: looping through testing each bit is not a solution)
how to check whether a linked list is circular.
#define clrscr() 100 main() { clrscr(); printf("%d\n",clrscr()); }
write a c program to Reverse a given string using string function and also without string function
struct Foo { char *pName; }; main() { struct Foo *obj = malloc(sizeof(struct Foo)); clrscr(); strcpy(obj->pName,"Your Name"); printf("%s", obj->pName); } a. Your Name b. compile error c. Name d. Runtime error
find simple interest & compund interest
Finding a number which was log of base 2
write a c-program to display the time using FOR loop
#include<stdio.h> main() { struct xx { int x=3; char name[]="hello"; }; struct xx *s=malloc(sizeof(struct xx)); printf("%d",s->x); printf("%s",s->name); }
int main() { int x=10; printf("x=%d, count of earlier print=%d", x,printf("x=%d, y=%d",x,--x)); getch(); } ================================================== returns error>> ld returned 1 exit status =================================================== Does it have something to do with printf() inside another printf().
main() { int i=5; printf("%d%d%d%d%d%d",i++,i--,++i,--i,i); }