Heap sort and complexity, Disjoint Union & Find, Complexity ...

More documents

Recommendations

Info

Chapter 2: Elementary Data Structures1 2 n 23 n 24nInitially1UNION(1,2)1 3UNION(FIND(1),3)25n2UNION(FIND(n-1),n)UNION(FIND(3),4)1 3 41 3 4 nIn order to implement the weighting rule, we need to knowhow many nodes are there in a tree. We maintain a COUNTfield in the root of every tree.
Chapter 2: Elementary Data StructuresIf i is the root of the tree then COUNT(i) = number of nodesin that tree. COUNT can be maintained in the PARENT fieldas a negative number.
Page 1 and 2: Chapter 2: Elementary Data Structur
Page 37 and 38: procedure F(i);var i,j : integer;be
Page 39: Chapter 2: Elementary Data Structur
Page 49 and 50: procedure FIND(i);var j:integer;beg
Page 51 and 52: Maze Application• Build a random
Page 53 and 54: Maze Application• Repeatedly pick
Page 55 and 56: A CycleStartEndRef: Ben Lerner Slid
Page 57 and 58: A Hidden TreeStartEndRef: Ben Lerne
Page 59 and 60: Basic Algorithm• S = set of sets
Page 61 and 62: ExampleS{1,2,7,8,9,13,19}{3}{4}{5}{
Page 63 and 64: Example at the EndStart1 2 3 4 5 67

Heap sort and complexity, Disjoint Union & Find, Complexity ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?