But just go to cs50.net, click office hours and you'll see the Google Calendar with all of the office hours that are still happening tonight, as well as tomorrow and these are just an opportunity to chat, to ask questions one on one with the teaching fellows or course assistants or frankly just a way to hang out during brain break and work on projects and then see what some of your friends might be tackling themselves.

但是我要提醒大家去cs50，net网站看看,这里清清楚楚告诉你,什么时候该学习工作，当然也包括今晚的明天的，我们还有一个机会供，一个与研究生助教或课程辅导员交流的机会,更直白来说,是提供你们开小差的机会,看看你们周围哪些人,在开小差呢。

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

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复杂度的排序算法,并且这是我今天想要讲的内容。

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