原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
described as mapping A onto B. When we say that f is onto, we mean that it is surjective.
A function f : A → B is an injection if distinct arguments to f produce distinct values, that is, if a ≠ a′ implies f (a) ≠ f (a′). For example, the function f (n) = 2n is an
injective function from ℕ to ℕ, since each even number b is the image under f of at most
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea