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

More documents

Recommendations

Info

Chapter 2: Elementary Data StructuresIf we perform these sequence of Union and Find-U(1,2), F(1), U(2,3), F(1), U(3,4), F(1),........., U(n-1,n).results in the degenerate tree.nn-11
Chapter 2: Elementary Data StructuresSince the time taken for union is constant, n-1 calls to U canbe processed in O(n) time. Time required to process F at leveli is O(i), n-2 calls of find takes O(n 2 ) time.Weighting rule: “if the number of nodes in tree i is less thanthe number of nodes in tree j, then make j the parent of i,else make i, the parent of j”.using the rule on the data set given before, and using the samesequence we have-
Page 1 and 2: Chapter 2: Elementary Data Structur
Page 37: 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 ...

Create successful ePaper yourself

Delete template?

Save as template?