If you want to check if your linked list is circular you can use Floyd’s Cycle-Finding Algorithm aka Tortoise and the Hare Algorithm.
It’s quite efficient as It has O(n) complexity.
Continue reading
Floyd’s Cycle-Finding Algorithm
Reply
Tag Archives: algorithms
Algorithms: Binary tree
Simple implementation of binary tree in C++ Continue reading
Share it with your friends:
Algorithms: Queue
Simple implementation of Queue with exception handling in C++ using templates Continue reading
Share it with your friends:
Algorithms: Stack
Simple implementation of Stack with exception handling in C++ using templates Continue reading
Share it with your friends:
Algorithms: Two-way linked list
Simple implementation of Two-way linked list in C++ Continue reading
