So for example, we often talk about teaching and I'd rather focus more on learning.
举例来说,我们经常讨论教的过程,而我觉得更应注重学的过程。
We'll talk more about this later, but it often happens that when you change your program to solve one problem you break it, and things that used to work don't work.
我们以后会更多的去讨论者一点,但是经常发生的情况是当你因为,一个问题修改你的程序的时候,你修改了程序,但原来没问题的模块。
Though he sometimes does talk about texts that we call "literary," indeed he very often does, nevertheless Derrida's position and the logic of that position suggest that we can't really reliably discriminate among genres.
尽管他有时确实会讨论被我们称为“文学“的文本“,事实上他经常如此,然而德里达的立场和他立场的逻辑,是我们不能够明确地划分文学的体裁。
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复杂度的排序算法,并且这是我今天想要讲的内容。
应用推荐