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

More documents

Recommendations

Info

Chapter 2: Elementary Data StructuresThe operation F(i) will find the root of the tree containingelement i. U(i,j) require two trees with roots i, j to be joined.procedure U(i,j);var i,j : integer;beginparent(i) := j;end.
procedure F(i);var i,j : integer;beginj:=i;While (parent(j) > 0) doj := parent(j)return(j)end.Chapter 2: Elementary Data Structuresperformance of U <strong>and</strong> F is not good, for ex. S i = {i}, 1 ≤ i ≤ n,then there is forest of n nodes with parent(i) = 0, 1 ≤ i ≤ n.
Page 1 and 2: Chapter 2: Elementary Data Structur
Page 35: 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 ...

Create successful ePaper yourself

Delete template?

Save as template?