原书出处
Introduction to Algorithms, Fourth Edition
C 附录C 计数与概率
(C.1) evaluates to 4!/2! = 12, matching the number of 2-permutations listed. Combinations
A k-combination of an n-set S is simply a k-subset of S. For example, the 4-set {a, b, c, d} has six 2-combinations: ab, ac, ad, bc, bd, cd. (Here we use the shorthand of
omitting the braces around each subset.) To construct a k-combination of an n-set, choose
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix003.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea