Tag Archives: Algos
Finding the Start of a Loop in a Circular Linked List
A lot of people are familiar with the problem of detecting a loop in a linked list. The problem goes as follows: “Given a linked list, what is the algorithm to determine if it has any cycles (loops)?” The algorithm … Continue reading
Filed under Algorithms, Java
Stern-Brocot Tree
Stern-Brocot tree is a tree data structure whose vertices correspond to the set of non-negative rational numbers. Thus, this tree provides a very elegant way for constructing the set of fractions m/n, where m and n are relatively prime. To … Continue reading
Filed under Algorithms
