Again. Basic premise of binary search, or at least we set it up was, imagine I have a sorted list of elements. We get, in a second, to how we're going to get them sorted, and I want to know, is a particular element in that list..
好,二分查找的基本前提,或者是我们建立二分查找的基础,我们已经有了一个排好序的元素列表,我们就需要知道如何来快速的排序,如何从列表中找到特定的元素。
and I knew if I wanted to be good, as good as I wanted to be, I needed to come here.
而且我知道,如果我想变得更好,变得和我想的一样好,我就得到这里来。
Having created this thing called Cartesian point, I'm going to create two instances of it.
这里面是控的,好,我们一会就会来完善它,但是类的概念就是。
Now we've set it up as a matrix, let's try again that question I asked before.
现在我们就把这个矩阵写好了,我们现在来回答之前的问题
It's sort of late in the day for students who have been through the better part of a semester thinking about the nature of death to argue, maybe, it wasn't such a good idea for you to take this class in the first place.
对学生来说有些太晚了,你们经历了大半个学期,思考着如何讨论死亡的本质,也许,你一开始来上这门课就不是个好主意。
because we are stressed, we try to compensate by having a lot of fun.
因为我们压力很大,我们就试着好好玩来弥补。
And you know it's not the necessarily a good idea to do it, you start with "The thing is".
你心里清楚这么做并不一定是个好主意,你就可以用“The thing is”来回答他们。
Is to say, okay now let's try to enrich the model, to add more into the model, and see if you get a different result, and if so why?
好吧,那我们就来完善这个模型吧,给这个模型加入新的约束条件,看看会不会得到不同的结果,如果是再分析原因
应用推荐