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

More documents

Recommendations

Info

Chapter 2: Elementary Data StructuresDisjoint Union:S UiFind(i): find a set containing element i.S = {all elements x such that x is in S i orjS j }.Challenge is to device data representation for disjoint sets sothat these operation can be performed efficiently.One possible representation of S 1 , S 2 , S 3 can be given by17 8 925 1034 6
Chapter 2: Elementary Data StructuresUnion: Make one of the trees a subtree of the other127 8 9 251105 107 8 9In order to find Union of two sets all one has to do is, set theparent field of the root to the other root. We identify the setsby the index of roots.
Page 1 and 2: Chapter 2: Elementary Data Structur
Page 33: Chapter 2: Elementary Data Structur
Page 37 and 38: procedure F(i);var i,j : integer;be
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?