《算法导论(第4版)》阅读笔记：p127-p133-CSDN博客

本文链接：https://blog.csdn.net/codists/article/details/148196643

《算法导论(第4版)》学习第 24 天，p127-p133 总结，总计 7 页。

一、技术总结

1. probabilistic analysis(概率分析)

(1)定义

Probabilistic analysis is the use of probability in the analysis of problems.

2. randomized algorithm

(1)定义

More generally, we call an algorithm randomized if its behavior is determined not only by its input but also by values produced by a random-number generator.

3. random-number generator & pseudorandom-number generator

(1)random-number generator

(2)pseudorandom-number generator

a deterministic algorithm returning numbers that look statistically random(一种具有确定性的算法，返回的数值具有统计学的随机性特征)。

3.集合

(1)disjoint sets

If the intersection of two sets is the empty set, then these sets are said to be disjoint.

二、英语总结(生词：1)

1. binomial

(1)binomial: bi-(“two”) + nomius(“name”)

binomial literally means “a name consisting of two terms”。c. [mathematics]an expression (= mathematical statement) that has two terms (= numbers or symbols) that are not the same(二项式)。For example “4x + y” is a binomial。

(2)示例

The study of the binomial distribution continues in Section C.5, an advanced discussion of the “tails” of the distribution(《算法导论(第4版)》第 1178 页)。

关于英语的注解同步更新汇总到 https://github.com/codists/English-In-CS-Books 仓库。

三、其它

刚看到 Cartesian product 的时候第一反应是“笛卡尔积”，但读着感觉读音不对啊，查了一下，Cartesian 的意思是“connected with the ideas and theories of the mathematician René Descartes”，看到有些翻译把 Cartesian product 翻译成“卡尔积”——从读音上来说，似乎更准确一些。