I'm going to set up an index, which is going to tell me where to look, starting at the first part of the list, right?
索引告诉我从哪里开始检索数组,对不对?,然后我会去记录下我做了多少次比较,这样我就能看到这个算法的工作量了?
And then, I usually make my way to, like, two others
然后,我会再去另两家俱乐部。
Let me give you, I'm going to create, q a polar point, I'm going to call it q, and we'll give it some random values.
让我给大家讲解下,我要去创建,一个极坐标点,然后我会去命名它为,然后我给它赋一些随机的值,好,现在我想知道。
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.
我会取一个元素,然后去查看列表,来决定要把那个元素放到哪里,这就意味着它依赖于列表的长度,对,这没什么说服力,但是事实上。
So I'm going to check to see if- really can't read that thing, let me do it this way-- right, I'm going to increase the number of compares, and I'm going to check to say, is the thing I'm looking for at the i'th spot in the list?
让我们这样做吧-好-,我会去增加比较次数的计数器,然后去看看在第i处的元素,是不是我要找的呢?,这里s的意思就是,给定数组的?
I'm going to give a name to that. And what you see there is I'm going to call divisors initially an empty tuple, something has nothing in it. Right here. And then I'm going to run through the same loop as before, going through this set of things, doing the check.
你们可以看到这里,我初始化一个空的元组,名为divisiors,这里,然后我会去运行,跟以前一样的循环,遍历这个集合内的东西,然后做检查,现在我要做的是,每次我找到了一个除数我要把它收集起来。
应用推荐