How will u find whether a linked list has a loop or not?
Answers were Sorted based on User's Feedback
Answer / sivaraj
BOOL findloop(struct node *start)
{
struct node *ptr,*ptr1;
ptr=start;
ptr1= start->next;
while(ptr!=NULL && ptr->next!=null && ptr1->next!=null &&
ptr1->next->next!=null)
{
if(ptr==ptr1)
return FALSE;
ptr=ptr->next;
ptr1=ptr1->next->next;
}
return TRUE;
}
Is This Answer Correct ? | 16 Yes | 5 No |
Answer / sanyam
the approach is to mark the nodes starting from the head.and
follow the links.
in the process if you find a node already marked then there
is loop.
Is This Answer Correct ? | 13 Yes | 2 No |
Answer / priya
same logic as 3rd answer..
typedef struct node
{ int data,mark; /*mark is all initialised to 0*/
node *next;
}node;
node* findloop(node* start)
{
node *p=start;
while(p)
{
if(p->mark==0)
{
p->mark=1;
p=p->next;
}
else
{
return p;
}
}
return p;
}
Is This Answer Correct ? | 3 Yes | 3 No |
Answer / karthik
I guess the return shud b TRUE in the if(ptr==ptr1) block
since that's the oly condition for presence of a loop in the
LL.. and return shud b a false after d while loop!!!
Is This Answer Correct ? | 0 Yes | 0 No |
Answer / zameer arif
You are right. In the loop, return should be true. outside
the loop, false.
Is This Answer Correct ? | 0 Yes | 0 No |
Answer / anurag srivastava
void lopp( node **start)
{
node *temp,*newnode;
temp=*start;
while(*temp && !(temp->next==start))
{ temp=temp->next; }
if(!(*temp)) printf("Non loop");
else printf("Loop");
}
Is This Answer Correct ? | 3 Yes | 5 No |
Answer / s.v.prasad reddy
findloop(struct node *start)
{
struct node *ptr,*ptr1;
start=ptr;
while(ptr!=NULL)
{
ptr1=ptr->next;
while(ptr1!=NULL)
{
if(ptr1->link==ptr->link)
{
printf("\nLoop found at %d node",ptr->data);
exit(0);
}
ptr1=ptr1->link;
}
ptr=ptr->link;
}
printf("\nNo Loop found in list");
}
Is This Answer Correct ? | 9 Yes | 17 No |
main() { int i = 258; int *iPtr = &i; printf("%d %d", *((char*)iPtr), *((char*)iPtr+1) ); }
#include<stdio.h> main() { struct xx { int x=3; char name[]="hello"; }; struct xx *s; printf("%d",s->x); printf("%s",s->name); }
Program to find the largest sum of contiguous integers in the array. O(n)
#include<stdio.h> main() { char s[]={'a','b','c','\n','c','\0'}; char *p,*str,*str1; p=&s[3]; str=p; str1=s; printf("%d",++*p + ++*str1-32); }
How we print the table of 3 using for loop in c programing?
void main() { static int i=5; if(--i){ main(); printf("%d ",i); } }
main() { printf("\nab"); printf("\bsi"); printf("\rha"); }
main() { int i=0; for(;i++;printf("%d",i)) ; printf("%d",i); }
main() { char a[4]="HELLO"; printf("%s",a); }
What is the hidden bug with the following statement? assert(val++ != 0);
There were 10 records stored in “somefile.dat” but the following program printed 11 names. What went wrong? void main() { struct student { char name[30], rollno[6]; }stud; FILE *fp = fopen(“somefile.dat”,”r”); while(!feof(fp)) { fread(&stud, sizeof(stud), 1 , fp); puts(stud.name); } }
Sir... please give some important coding questions asked by product companies..