Heap sort and complexity, Disjoint Union & Find, Complexity ...
Heap sort and complexity, Disjoint Union & Find, Complexity ...
Heap sort and complexity, Disjoint Union & Find, Complexity ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Chapter 2: Elementary Data StructuresAlternate representation: Represent each set by its element.If there is any ordering relationship between them then theoperation such as union <strong>and</strong> intersection can be carried out intime proportional to the length of the sets.We represent sets as trees.We assume that they are pair wise disjoint <strong>and</strong> perform theseoperations.