uniq(读做“unique”)，扫描列表，比较列表中的相邻元素，以去除任何重复项。

Uniq (pronounced "unique") scans a list, comparing adjacent elements in the list and removing any duplicates. For instance, suppose you have this list.

youdao

同样，您会想到首先填充一个比较键列表，然后进行排序，而不是进行内联排序。

Again, you're driven to the idea of first filling a list of comparison keys and then sorting, rather than sorting inline.

youdao

列表与元组相似，但是元组只能在比较中使用，而列表允许执行的操作更多。

Lists and tuples are similar, but whereas a tuple can only be used in a comparison, lists allow a wider variety of manipulation operations to be performed.

youdao

So compare the front of this list which is 4 2 against the front of this list which is 2.

因此比较这个列表中的4和4,这个列表中的。

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

Now, compare the first element in each of these lists. Two is less than three, so two ought to be the next element of the list.

现在，比较每个列表的第一个元素,2要比3小，所以2应该是合并后列表的，下一个元素，然后你们就知道了。

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

Advance this pointer-- this finger, to the next element of the list which is 4, make the comparison.

前移这个指示器--也就是这根手指，让它指向列表中的,下一个元素4，再做比较。

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