And you really, wherever possible, want to avoid that exponential algorithm, because that's really deadly. Yes.

比你的电脑的性能增长的快多了，并且大家无论何时，都要避免去用指数级的函数。

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

But,excuse me, one is it's never be.

但是，一是它从来没有这么快的增长。

普林斯顿公开课 - 国际座谈会课程节选

It says that function, f of x, is bounded above here's an upper limit on it, that this grows no faster than quadratic in n, n squared.

这意味着这个方法f是有上限的,这个方法增长的速度,不会比括号内的n*n快。

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