Everything About ___
Live briefing

Everything about Interval union-split-find

In computer science, an interval union-split-find data structure is a data structure that stores a partition of the integer interval into intervals. Equivalently, it stores a set of elements from ("splitters"), which define the endpoints of the intervals; for example, if n=10 and the set of endpoints is then the intervals are and. The data structure provides the following operations:split(x) adds x as a splitter, thus splitting the interval containing it (if x has not already been a splitter) union(x) for merging two intervals by removing the splitter x find(x) for finding which interval x belongs to (returning the interval's endpoint). Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Interval union-split-findA 5-minute orientation
  2. Pick up a classic book: Mathematical PuzzlesThe most-reprinted book on the subject
  3. Go sideways: Disjoint-set data structureA closely related topic
  4. Go sideways: Pointer algorithmA closely related topic

đź“– Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. The Interval Union-Find Problem
  2. The Interval Split-Find Problem

🏆 Landmark papers (most cited)

đź“š Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

đź”— Related topics