-
The list tells what services they offer and how much they want to be paid.
VOA: special.2009.02.02
-
If I want to create a set or a sequence representing these things, I simply insert into that list.
如果我想创建一个集合,或者一个序列表示这些东西，我只要简单的把它插入列表中。
-
And I want to show you a little bit more detail of that, so let's create a simple little list here.
我还想给你们再讲详细些,那让我们来创建一个简单的列表吧。
-
Put yourself down on the wait list if you don't get into the section you want.
如果你想换个小组,请在等候名录里预约
-
Now, you can bet when these folks came and consulted the priest and could you please put us down on the list, we want to consult the oracle, the priest said sure have a beer, let's talk about your hometown, what's going on out there.
你能想到,当人们到此请示神谕,会对祭司说,您能把我们的名字写在表里吗,我们想询问神谕,祭司说有啤酒就行,我们先说说你的家乡,那儿发生了什么事
-
The last thing I want to point out to you is, I started out with this list. I haven't added anything to the list, right? I mean I've got a different kind of looping mechanism.
我们从这个列表开始，我没往这个列表上加任何东西对不对？,我的意思是我学会了一种不同种类的,循环机制，我想我得说。
-
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..
好，二分查找的基本前提，或者是我们建立二分查找的基础,我们已经有了一个排好序的元素列表，我们就需要知道如何来快速的排序,如何从列表中找到特定的元素。
-
As I keep moving down, that part gets smaller, it's not always the initial length of the list, and you're right. But if you do the sums, or if you want to think of it this way, if you think about this more generally, it's always on average at least the length of the list.
等等，随着移动，剩下的部分越来越小，并不是初始那么长了，如果你算一算，或者你这么想，你考虑更一般的情况，平均下来至少是列表的长度。
-
Are you sure you didn't want to do for i in range of list, rather than for i in list?
你真的打算这么做吗？你确定你不是,想在链表范围内定义i而不是定义链表i？
-
And the example I want to look at is, suppose I want to search a list that I know is sorted, to see if an element's in the list.
看看目标元素在不在数组里，也就是说我要去,检索一个有序的数组。
-
And as a consequence, access time in the list is constant, which is what I want.
这会占用一些额外的空间，回到问题本身，这么做的话，读取数组的时间就变成常量了。
-
So let me expand on that very slightly, and again we did this last time but I want to do one more time. I have to be careful about how I'm actually implementing a list.
我们之前做过了一次,但还是再做一次吧,我得小心的在列表中执行,例如在这个例子中。
-
I did not want to make a list, I wanted to create a tuple thank you for catching it. I want parens not square brackets there.
为什么这里有错误了，我并不想要创建,一个列表，我想创建一个元组，谢谢你,发现了这个错误。
-
Hmm. Well, wait a minute. If I want to sort a list, I'll take one element, I've got to look at probably a lot of the other elements in the list in order to decide where it goes. And that suggests it's going to depend on how long the list is.
我会取一个元素，然后去查看列表,来决定要把那个元素放到哪里,这就意味着它依赖于列表的长度,对，这没什么说服力，但是事实上。
-
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?
我只能做线性搜索了,一次遍历一遍列表，一个一个比较，但如果我想要,那怎样得到有序的列表呢？,现在的一个问题是，我们排序之前？
-
I think the easiest way to look at what this does, is let's take a really simple example- I want to make sure I put the right things out- I've got a simple little list of values there.
到底做了什么，就是让它跑一个简单的例子，我想要确信我找到了正确的元素-,这里我用一个简单的小的列表-,如果我去代码里面看。
-
And what does that say? It says, let's assume I want to do k searches of a list. OK.
如果我们假定要在列表中做k次搜索,在线性的情况下，假定是一个未排序的情况。
-
To get any location in memory, to get to any value of the list, I simply have to say which element do I want to get, I know that these things are stored in a particular size multiply that index by 4, add it to start, and then it's in a constant amount of time I can go to that location and get out the cell.
取得列表中的任何一个值,简单说来，想要取得列表中的任何元素,我知道这些元素存在特定的大小中,把下标乘以4，加到start上,然后定位到内存单元，并取出值就是固定的时间了,好的，如果元素以固定大小存储。
应用推荐