原书出处
Introduction to Algorithms, Fourth Edition
C 附录C 计数与概率
e S as consisting of the set of all possible 2-strings over {H, T}: S = {HH, HT, TH, TT}.
An event is a subset1 of the sample space S. For example, in the experiment of flipping two coins, the event of obtaining one head and one tail is {HT, TH}. The event S is called the
certain event, and the event ∅ is called the null event. We say that two events A and B a
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix003.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea