So the integers are totally ordered the reals are totally ordered lots of things are, the rationals are totally ordered.

对正数来说,这样的序列是排好序的,对实数也是如此,对很多事情都是如此。

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

And the nice thing is that there's a shared behavior there. Just as I can have tuples as an ordered collection of things, strings behave as an ordered collection of things.

共享的行为，就像元组是有序的元素序列,字符串也是有序的元素序列,因此我可以对字符串做同样的操作,我可以把它们连结起来。

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

Well here is my array of 8, you know what, it's too much work to sort all 8.

这是有8个杯子的一个序列，要对这8个杯子进行排序就会花费较大功夫。

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

The DNA that encodes the proteins that are important to the life of that cell.

只发生于编码特定蛋白质的DNA序列,这些蛋白质对细胞而言至关重要

耶鲁公开课 - 生物医学工程探索课程节选

You don't see strings with commas between them, but it has the same kind of property. It is in ordered sequence of characters.

它是有序的字符序列,我们可以对字符串做同样的操作,我们也可以得到字符串中的一块。

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

Really there's no work to be done if I am handed all in sorted order so, you know, There's no work to be done if I'm handed all of the arrays in sorted order so, you know, if I demand that you give me this assumption that the cups are already sorted and then I'll sort them for you, I mean, this is kind of a cyclical argument.

如果杯子是有序排列的,那就没必要再对它进行排序了，同样如果给出的序列本身就是有序的,那也不必再做什么，如果给出这样的假设：,杯子已经有序，但仍需要对其进行排序，这像是个循环的论点。

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

In the linear case, meaning in the unsorted case what's the complexity of this? k times n, right? Order n to do the search, and I've got to do it k times, so this would be k times n.

复杂度是多少？k的n次方，对吧？,在序列n中做搜索，要做k次，所以是k的n次方次,如果先排序后搜索。

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

The end result is you can design now very specific double stranded RNA sequences, that when delivered into cells again will activate this process of natural degradation of an existing messenger RNA.

最终的结果是,你现在能够设计针对性很强的,双链RNA序列,当这段序列被转入细胞后会激活,对已有信使RNA进行降解的过程

耶鲁公开课 - 生物医学工程探索课程节选