Remember last time, I said that there's different kinds of complexity in our code, and I suggested for simple branching programs, the amount of time it takes to run that program is, in essence, bounded by the number of instructions, because you only execute each instruction at most once.

但是这里有个很重要的点,记得上节课，我提过在我们的代码中，有不同种类的复杂度，而且我还说了对于简单的分支程序,运行这种程序需要的总体时间,大体上，是和指令的数目相关的,因为每个指令只会被执行最多一次。

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

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快。

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