-
So, if you want to go at 1:00, you're welcome to do so, but please arrange it with my assistants.
如果你想去上1点的课，也可以，但是一定要和我的助教安排一下。
-
I also think that if you were to go a little bit lower than that in terms of like...
我还想，如果你想要比它稍微档次低点儿的，比如……
-
And if someone said, it's 4%, you'd say, well that's kind of meager, I want a better dividend than that.
如果他说,是4%,你会觉得少,我想要更高的股利
-
But if I want to do it all in one shot, what is the equivalent step I should take?
但我如果想要一步完成,那我应该用什么样的等价步骤呢
-
I study speech, I study speeches, and if I do so, and if I keep thinking about it in a variety of ways, all sorts of frameworks jostle for attention.
我就必定要研究话语，如果我想要从尽可能多的角度研究它，那么各式各样的的语言结构令我眼花缭乱。
-
So if I try to apply the same logic, well how can I divide and conquer this problem.
如果我想要用同样的逻辑，那么怎样划分,并解决这个问题呢？
-
The reason I want to point this out to you is, if we go back up to the kinds of data objects we started with, floats, ints, strings, they actually behave the same way.
我要为大家指出这一点的原因是，如果我们想一下以前讲过的,数据类型的种类，浮点数，整数，字符串，它们实际上有相同的行为方式。
-
Well in the class session that I'll be giving I'll be talking More about the others. I hope to stimulate the Discussion. If you want more information on the slide As my contact information and you can contact me.
在讨论课阶段,我还有相关的其他内容要讲,我希望能激发讨论,如果你们想要幻灯片上的更多内容,可以根据我的联系方式联系我。
-
If you want the book, that's the book I use.
如果你想要买，这就是我要用的书。
-
What I mean is when you wish to express that you are sorry if you've done something wrong
在这里我是指，你想要表达的是，如果你确实有过失，你感到很抱歉，
-
If I wanted to get full, real division, I should make one of them a float.
如果我想要得到真正的除法答案，我需要把他们之中的一个,变为浮点数类型。
-
If I want to get out right now the versions of these things, I can ask what's the value of c p 1 x, and it returns it back out.
你可以在那里看到那些,代表笛卡尔坐标点的东西，如果我想要得到现在，这个类的版本的东西的话。
-
So if I were to solve this problem, here's the way I would do it. I would say, first thing I want to do, is I want to input a value for the base as a float.
如果我想要解决这个问题，这就是我要解决它的方式了，第一件我要做的事情就是要,输入一个浮点数作为三角形的底。
-
It says, if I want to print out something I built in Cartesian form up here, says, again, I'm going to pass it in a pointer to the instance, that self thing, and then I'm going to return a string that I combine together with an open self and close paren, a comma in the middle, and getting the x-value and the y-value and converting them into strings before I put the whole thing together.
这不仅仅是个列表,它是怎么来做的？,流程是：如果我想要返回,一些已经在笛卡尔模式下建好的值，好，再说一遍，我首先要传入一个,指向实例的指针,也就是，然后我会返回一个,由开括号，闭括号,中间的一个逗号,以及提前转换为字符串格式的。
-
Well let's see. My fall back is, I could just do linear search, walk down the list one at a time, just comparing those things. OK. So that's sort of my base. But what if I wanted, you know, how do I want to get to that sorted list? All right?
我只能做线性搜索了,一次遍历一遍列表，一个一个比较，但如果我想要,那怎样得到有序的列表呢？,现在的一个问题是，我们排序之前？
-
But long story short, if I want to use a function called sleep, -- the reason I, the programmer, knew to use that library -- -- that header at the top -- because it told me to in this little synopsis.
但长话短说，如果我想要用一个叫做sleep的功能，我作为程序员知道使用那个函数库-,上面的标题-,因为在这个小的大纲中它告诉我。
-
It says if I want to get the length of a segment, going to pass in that instance, it says from that instance, get the start point, that's the thing I just found.
它的意思是如果我想要,得到一个线段的长度，首先要把这个实例传进来，然后对于这个实例，从开始点，取得x坐标，然后通过同样的操作。
-
So it's an address, it's a pointer, address pointer, synonyms for now, so it's the address of a char so this makes sense because s1 is also the address of a char so if I wanted to make a copy of that address this is absolutely the right syntax.
是一个地址，是一个指针，地址指针，也就是，char型数据的地址,这是有意义的，因为s1也是一个char型数据的地址,所以如果我想要复制那个地址,这个绝对是正确的语法。
-
If they type in bogus characters, it's going to yell at them and make them retry, and eventually I'm going to get handed back an int, which I'm storing in n. Well, if I actually want to judge this number based on its magnitude, well, I can say now, "If n is greater than or equal to one."
如果他们键入了不合法的字符，它将对他们叫喊,然后叫他们重试，最终我将,得到一个int数，它是存储在n中的，好的，如果我的确想要根据它的量级来判定这个数字，好的，现在我可以指明，“是否n大于等于1“
-
So to just preface what we're going to do next time, what would happen if I wanted to do sort, and rather than in sorting the entire list at once, I broke it into pieces, and sorted the pieces, and then just figured out a very efficient way to bring those two pieces and merge them back together again?
所以为了引导下一次,我们要讲的内容,如果我想做排序,而且不是一次吧整个列表排完,会发生什么，我把它拆成小的列表,然后把各个小列表排序,接着用高效的方法再把小的列表？
-
So, for example: in this case, my list is a bunch of integers. And one of the things I could take advantage of, is I'm only going to need a finite amount of space to represent an integer.
列表是一系列整数,要注意的这里的优势能够,用有限的空间来表示整数,例如，如果我想要操作。
-
Because what I want to do is, 01 say if self dot price is less than 0.01, 0 I'm going to set it to 0, just keep it there.
因为我想要做的是，比方说如果self。price小于0。,我就把它的值设为，然后放在那。
-
Because in doing that, Python would then have a value that it could pass on into some other part of a computation, and if it wasn't what I wanted, I might be a long ways downstream in the computation before I actually hit some result that makes no sense.
因为如果这样做的话，Python会将,输入的值传递到下面的,一些运算中去，如果这个值的类型不是我想要的，我可能会在得到,一个毫无意义的结果之前,经历一个很长时间的,计算过程。
应用推荐