数据结构与算法分析c++版课件_2数据结构与算法分析c++版课件_2.pdfVIP

数据结构与算法分析数据结构与算法分析数据结构与算法分析数据结构与算法分析 A Practical Introduction to Data Structures and Algorithm Analysis 22 MathematicalMathematical PreliminariesPreliminaries Set concepts and notation LogarithmsLogarithms Summations and Recurrences Recursion MMaththematiticall PProoff TTechhniiques Estimation 2 SetsSets andand RelationsRelations Set: A collection of distinguishable members or elements. {2,3,5} x ∈P Bag: A collection of elements with no order (like a set), but with duplicate-valued elements. [3,4,5,4] Sequence: A collection of elements with an order, and which may contain duplicate-valued elements. 33,44,55,44 A relation R over set S is a set of ordered pairs from SS. Ex: if S is {a,b,c}, then {a,c,b,c,c,b} is a relation. SetsSets andand RelationsRelations If tuple x, y is in relation R, we may use the infix notation xRy. DDefifine ththe propertities off rellatitions as ffollllows, withith RR a binary relation over set S. RR isis reflexivereflexive ifif aRaaRa forfor allall aa ∈∈SS. R is symmetric if whenever aRb, then bRa, for all a, b ∈S. R is antisymmetric if whenever aRb and bRa, then a = b, for all a,b ∈S. R is transitive if whenever aRb and bRc, then aRc, for all a, b, c ∈∈SS. antisymmetric = reflexive,reflexive, antisymmetric,antisymmetric, andand transitivetransitive = reflexive, symmetric (and antisymmetric!), and transitive EquivalenceEquivalence RelationRelation R is an equivalence relation on set S if it is reflexive, symmetric, and transitive. An equivalence relation can be used to partitionpartition aa setset intointo equivalenceequivalence classesclasses. If two elements a and b are equivalent to each otherother, wewe writewrite aa bb. A partition of a set S is