C++ Programming Question:
How do you find out if a linked-list has an end? (i.e. the list is not a cycle)
Answer:
You can find out by using 2 pointers. One of them goes 2 nodes each time. The second one goes at 1 nodes each time. If there is a cycle, the one that goes 2 nodes each time will eventually meet the one that goes slower. If that is the case, then you will know the linked-list is a cycle.
| Previous Question | Next Question |
| What is polymorphism in C++? | How can you tell what shell you are running on UNIX system? |