原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
S itself, by 2S, called the power set of S. For example, 2{a,b} = {Ø, {a}, {b}, {a, b}}.
The power set of a finite set S has cardinality 2|S| (see Exercise B.1-5). We sometimes care about setlike structures in which the elements are ordered. An ordered pair of two elements a
and b is denoted (a, b) and is defined formally as the set (a, b) = {a, {a, b}}. Thus, th
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea