• And what does that say? It says, let's assume I want to do k searches of a list. OK.

    如果我们假定要在列表中做k次搜索,线性的情况下,假定是一个未排序的情况。

    麻省理工公开课 - 计算机科学及编程导论课程节选

  • And then, if I want to find out if something's there, I do the same thing. But notice now, hash is converting the input into an integer.

    然后,我想查找出某些元素是否在列表中,我做同样的事,但是现注意,哈希是将输入转化成一个整数,所以,其思想是什么?

    麻省理工公开课 - 计算机科学及编程导论课程节选

  • This one here, this one here, the lightest elements of each are where?

    一个这,另一个这,每个列表中最轻的元素哪呢?

    哈佛公开课 - 计算机科学课程节选

  • If we could do sort, then we saw, if we amortized the cost, that searching is a lot more efficient if we're searching a sorted list.

    如果我们可以做排序,然后我们可以看到,如果我们分摊开支,有序列表中搜索将会变得更高效。

    麻省理工公开课 - 计算机科学及编程导论课程节选

  • 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.

    我们之前做过了一次,但还是再做一次吧,我得小心的在列表中执行,例如这个例子

    麻省理工公开课 - 计算机科学及编程导论课程节选

  • Right? If that was the case in that code, then my complexity is no longer log, because I need linear access for each time I've got to go to the list, and it's going to Lisp be much worse than that.

    这里的复杂度不再是对数的了,因为每次在列表中,查找需要线性访问,可能还要糟糕,其实,有些编程语言,如。

    麻省理工公开课 - 计算机科学及编程导论课程节选

  • So let me move down the list or put this cup back.

    在列表中继续向下移,将这个杯子放回去。

    哈佛公开课 - 计算机科学课程节选

  • You try to design actually I'm going to come back to that in a second. It's like you're trying to use a hash function that spread things out pretty evenly. But the places you store into in those lists may have to themselves have a small list in there, and when you go to check something, you may have to do a linear search through the elements in that list.

    你尝试着去设计,实际上过会儿我会回头讲解这个问题,类似于你需要用一个哈希函数,非常平均的将物体分发出去,但是在列表中你数据,映射到的地方可能会有自己的一小段列表,当你回头查找数据的时候,你可能需要那一小段列表中做线性查找。

    麻省理工公开课 - 计算机科学及编程导论课程节选

  • 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.

    首先是插入排序,此算法,需要遍历整个列表,将你遇到的第一个元素放其正确的位置,然后移动到下一个元素,继续处理-,不管是什么元素,都将其插入到合适的位置。

    哈佛公开课 - 计算机科学课程节选

  • STUDENT: PROFESSOR: In both lists, right.

    学生:【难以理解】,教授:两个列表中,这是线性的,O的。

    麻省理工公开课 - 计算机科学及编程导论课程节选

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定