Answer Posted / jaroosh

The above method is working of course, but is not the most
efficient. Other methods are however quite complex and not
so easy to explain.
Anyway, to exemplify this aforementioned method, maybe not
the most efficient code, but off the top of my head, hope
there are no misspellings.

bool isCyclic(LinkedNode *list)
{
if(list == NULL || list->next == NULL) return false;
LinkedNode *node1 = list, *node2 = node1->next;
while(node1 != node2)
{
if(node1==NULL || node2==NULL || node2->next == NULL)
return false;
node1 = node1->next;
node2= node2->next->next;
}
return true;
}

NOTE: the assumption is that for noncyclic list, the last
node has next pointer set to NULL.

When would you use a pointer to a function?

1010

---

What is c system32 taskhostw exe?

989

---

Explain what are its uses in c programming?

1036

---

Why do we use & in c?

958

---

What are the 5 elements of structure?

1050

---

What is use of bit field?

1254

---

write a program for the normal snake games find in most of the mobiles.

2225

---

Why is main function so important?

1064

---

What is a example of a variable?

967

---

What is build process in c?

1097

---

What is a pointer in c?

1458

---

What is getch () for?

1166

---

write a program to create a sparse matrix using dynamic memory allocation.

4857

---

Describe the difference between = and == symbols in c programming?

1316

---

Why clrscr is used in c?

964

---