So just as we had to escape things with backslashes in an awkward way, same deal with percent in this context.
所以就像我们采用笨拙的方式来用反斜杠来避免一些东西,在这个背景下对百分号做相同的处理。
In other words, we need criteria for equilibrium under more general conditions than the ones that we've dealt with so far, than the one set of conditions that we've dealt with so far, which is isolated system.
换句话说,相比我们目前为止,考虑和处理的问题,我们需要更一般条件下平衡的判据,我们目前,只考虑了孤立系统。
So this first line of code, and some of this again we'll be rehashed but at least you can delight in the awkwardness that is this demonstration.
因此,第一行代码,有些地方我们需要重新处理下,但至少看到这次,笨拙的演示你会很高兴。
Most of the time, when we deal with vectors, we don't draw these arrows anymore.
多数情况下,当我们处理矢量时,就不再画出这些箭头了
All right. What does this have to do with my divisor example? This says I can make tuples, but imagine now going back to my divisor example and I want to gather up the elements as I go along. I ought to be able to do that by in fact just adding the pieces in.
这意味着我可以创建元组了,但是想像下回到我们的除数的例子,在处理过程中我们想把目标数的除数,收集起来,我应该能够通过把这些数,一个一个加进来来实现这个目的,我正是要去这么做,也就是。
So I'm going to distinguish in fact between un-handled exceptions, which are the things that we saw there, and handled exceptions. I'm going to show you in a second how to handle them, but let's look at an example.
所以我打算区分开不可处理的异常,以及我们刚才看到的,可以处理的异常,我一会要给你们演示下如何处理他们,给你们看一个例子。
So the first one here is something called insertion sort which amounts to going through the list, taking the first thing that you see and inserting that element into its correct place, - then moving on to the next one, dealing with what element-- whatever element you're given and putting it in its right place.
首先是插入排序,在此算法中,需要遍历整个列表,将你遇到的第一个元素放在其正确的位置,然后移动到下一个元素,继续处理-,不管是什么元素,都将其插入到合适的位置。
Ah-ha. What does that say to do? It says, 3 gee, make min index point to there min value be 3. Change j. Is 6 bigger than 3?
啊哈,这该怎么处理呢?,让MinIndex指向那里,MinVal是,改下j值,6比3大么?
应用推荐