Wednesday, August 15, 2012

Algorithm of the Week: Detecting and Breaking a Loop in a Linked List

Algorithm of the Week: Detecting and Breaking a Loop in a Linked List: Introduction
Linked lists are one very common and handy data structure that can be
used in many cases of practical programming. In this post we’ll
assume that we’re talking about a singly linked list. This means that each
item is pointed by its previous item and in turn points to its next item.
In this scenario the first item of the list, its head, doesn’t have an
ancestor and the last...

DIGITAL JUICE

No comments:

Post a Comment

Thank's!