We've had a great deal to do with it, but of course we still haven't the slightest idea what it is.

我们花了很大的功夫来接解决这个问题，但我们仍然一点都不知道语言是什么。

耶鲁公开课 - 文学理论导论课程节选

Music gravitates around a home pitch and in the Beethoven Fifth symphony we still haven't gotten the home pitch.

音乐的音高一般会围绕着主音高浮动,在贝多芬的第五交响乐中　,我们还没发现这个主音高

耶鲁公开课 - 聆听音乐课程节选

The question we're left with, the fundamental question we still haven't answered is what then becomes of consent?

剩下的就是最基本的问题,我们仍未解答,究竟同意是什么？

耶鲁公开课 - 公正课程节选

And then one of the things that I suggested was that if we could figure out some way to order it, and in particular, if we could order it in n log n time, and we still haven't done that, but if we could do that, then we said the complexity changed a little bit.

这就涉及到了排序,如果可以想出一种来将其进行排序,甚至可以在n，log，n的时间内完成,虽然目前我们没做这件事,但是一旦开始做这件事,那么复杂性就是发生一些变化。

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

We go that far and we still haven't heard the home pitch.

我们其实早已经知道的,只是还没听到而已

耶鲁公开课 - 聆听音乐课程节选

And that's just a way of reminding you that we want to think carefully, but what are the things we're trying to measure when we talk about complexity here? It's both the size of the thing and how often are we going to use it? And there are some trade offs, but I still haven't said how I'm going to get an n log n sorting algorithm, and that's what I want to do today.

这只是在提醒你们我们要仔细的思考问题,但是当我们在讨论复杂性的时候,我们到底要衡量哪些东西？,是列表的大小和对其进行查找的频率吗？,这里面临一些取舍,但是我还没有说明,怎样得到一个n，log，n复杂度的排序算法,并且这是我今天想要讲的内容。

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