O Right there, order n. So I have order n operations at each level in the tree. And then how many levels deep am I? Well, that's the divide, right? So how many levels do I have?

在这儿,所以我在树的每个层次都要做O的操作,那个这棵有多少层呢？,这是一个除法，不是吗？

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

One, two, three, four, so on each level of the picture I'm drawing, I've seem only to be looking at each number once.

，2，3，4，可见，在我画的,这幅图的每一层上，对每个数字,都只会用到一次。

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