Operations on sets of intervals - an exercise for data structures or algorithms
Bob P. Weems · ACM SIGCSE Bulletin · 1989
Ordered linked lists are introduced in data structures courses and are frequently encountered in the study of algorithms. Set operations (e.g. union, intersection) on sets of real intervals provide a non-trivial exercise in developing correct algorithms for manipulating lists.