也就是说当问题规模变大的时候，算法计算的时间会怎样增长？

How does this thing grow as I make the problem size big?

youdao

这和2008年的问题规模不能相提并论，那时呆账是股本的数以倍计而盈利则是全面崩盘。

That is a different scale of problem from 2008, when bad assets were multiples of many Banks' capital and earnings had collapsed.

youdao

随着问题规模的变大，解决问题花费的代价是怎么增长的，因此我们将会主要地讲讲？

What we really want to worry about is, as the size of the problem gets larger, how does this thing grow? How does the cost go up?

youdao

In fact, better than that, this guy is already sorted as well because I whittled that problem down to size 1.

事实上，更好的结果是这个杯子也是有序的了,因为我已将这个问题的规模削减到只有1个元素。

哈佛公开课 - 计算机科学课程节选

A log algorithm typically is one where you cut the size of the problem down by some multiplicative factor.

对数级复杂度的算法就是指,通过一系列常量级步数的操作,可以将问题的规模。

麻省理工公开课 - 计算机科学及编程导论课程节选

It implies that this algorithm is calling itself again and again, and again, and on each time the size of the problem I'm trying to sort is being divided by what?

这就说明此算法会一次又一次地调用自己,每次我要排序的问题规模大小,会除以多少呢？

哈佛公开课 - 计算机科学课程节选