In Week 2 we'll look at things like cryptography and functions and the tools that by which you begin to assemble solutions to problems; in Week 3 we'll introduce what are generally ; known as algorithms and data structures; mechanisms by which you can solve problems more efficiently, effectively.

第2周,我们学习加密技术及其功能,还会学到一些操作工具,通过这些工具的使用来收集解决问题的办法,第3周,我们将介绍;,算法和数据结构,以及可以更有效地解决问题的机制。

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

And in this case, we go from 8 to 4 to 2 to 1 three times and then on each iteration of this algorithm, each pass across the board I'm touching N numbers, so that means I'm doing N things, log N times.

在这个例子中，我们从8得到4，到2，再到1，是3次,在这个算法的每次迭代中，每一趟我都会操作N个数，也就是所我每次要做N步操作，一共要做，log，N，次。

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