原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
guments: f (2) = 1 and f (3) = 1. An injection is sometimes called a one-to-one function.
A function f : A → B is a bijection if it is injective and surjective. For example, the function f (n) = (−1)n⌈n/2⌉ is a bijection from ℕ to ℤ: 0 → 0, 1 → −1, 2 → 1, 3 → −2, 4 → 2,
⋮ The function is injective, since no element of ℤ is the image of more than one element
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea