原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
. A set cannot contain the same object more than once,1 and its elements are not ordered.
Two sets A and B are equal, written A = B, if they contain the same elements. For example, {1, 2, 3, 1} = {1, 2, 3} = {3, 2, 1}. We adopt special notations for frequently encountered
sets: Ø denotes the empty set, that is, the set containing no members. ℤ denotes the set
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea