Created
September 4, 2015 10:54
-
-
Save agr-shrn/8e7b1285cb90bf9dd1cf to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<iostream> | |
using namespace std; | |
struct node | |
{ | |
int data; | |
struct node *next; | |
}; | |
void new_node(struct node **head,int data) | |
{ | |
struct node *ptr,*temp; | |
temp = *head; | |
ptr = new node; | |
ptr->data = data; | |
ptr->next = NULL; | |
if(*head == NULL) | |
{ | |
*head = ptr; | |
} | |
else | |
{ | |
while(temp->next!=NULL) | |
temp = temp->next; | |
temp->next = ptr; | |
} | |
//cout<<ptr->data; | |
} | |
void loop(struct node *head,int b) | |
{ | |
struct node *temp = head; | |
int c=0; | |
while(head->next !=NULL) | |
{ | |
if(c == (b-1)) | |
temp = head; | |
head = head->next; | |
c++; | |
} | |
head -> next = temp; | |
} | |
void display(struct node *head) | |
{ | |
//struct node *temp; | |
//temp = head; | |
int c=0; | |
while(c<=10 && head!=NULL) | |
{ | |
cout<<head->data<<"-->"; | |
head = head->next; | |
c++; | |
} | |
} | |
int loopdetect(struct node *head) | |
{ | |
struct node *slow,*fast,*temp; | |
//temp = new node; | |
//temp->next = NULL; | |
//temp->data = 0; | |
/*slow = new node; | |
fast = new node;*/ | |
slow = head; | |
fast = head; | |
slow=slow->next; | |
fast=(fast->next)->next; | |
while(slow != fast && fast!=NULL) | |
{ | |
//cout<<"\n\nSharan"; | |
slow = slow->next; | |
fast = (fast->next)->next; | |
} | |
//temp = slow; | |
//cout<<"\n"<<temp->data; | |
if(slow == fast) | |
{ | |
cout<<"\n\nADFassdf"; | |
slow = head; | |
while(slow != fast) | |
{ | |
slow = slow->next; | |
fast = fast->next; | |
} | |
cout <<"\n\n"<<slow->data; | |
} | |
else | |
return 0; | |
} | |
int main() | |
{ | |
struct node *head,*ptr; | |
int ch,data,b=0; | |
head = NULL; | |
do | |
{ | |
cout<<"Enter choice:"; | |
cin>>ch; | |
switch(ch) | |
{ | |
case 1: | |
cin>>data; | |
new_node(&head,data); | |
display(head); | |
break; | |
case 2: | |
cin>>b; | |
loop(head,b); | |
display(head); | |
break; | |
case 3: | |
// loop detection | |
int loopexist=0; | |
loopexist = loopdetect(head); | |
if(loopexist == 0) | |
cout<<"no loop"; | |
} | |
} | |
while(ch!=4); | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
change the condition in line
73
to thisslow != fast && fast->next!=NULL && fast->next->next!=NULL
and it works fine! 😉