Cut the problem in half. Cut the problem in half again. And that's a typical characterization of a log algorithm.
是每次除以特定的量,将问题减一半,再减一半,如此,这就是对数算法的典型特性。
It only stands to reason, I think, that Milton would want to inscribe within this poem the problem posed by this extraordinarily compelling characterization of Satan.
理所当然,弥尔顿会想要在始终写明这个问题,关于撒旦过分引人注目的性格的问题。
Then they look at the visualization and they see a global characterization of the field.
然后他们观看直观化过程,他们会看到一个,全球化领域。
Typical characterization, not all the time, but typical characterization, is an algorithm that reduces the size of a problem by one, or by some constant amount each time, is typically an example of a linear algorithm.
我们学习过了线性算法,它的典型特征,不是通用的,但是比较典型的特征是,它是逐一减小问题的大小的,或者说是每次减小常数的大小。
应用推荐