← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

B 附录B 集合等离散数学基础

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.789Z

e already well versed in this material, you can probably just skim this chapter. B.1 Sets

A set is a collection of distinguishable objects, called its members or elements. If an object x is a member of a set S, we write x ∈ S (read “x is a member of S” or, more briefly, “x

belongs to S”). If x is not a member of S, we write x ∉ S. To describe a set explicitly,

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea