例如，假设您需要获得组成云的管理程序的快速列表。

For example, suppose you just wanted a quick listing of the hypervisors that make up your cloud.

youdao

使用这种具有链表的散列表可以提供最快速的查询功能。

The use of the hash table with linked list provides the quickest lookup.

youdao

该列表将会快速显示出谁执行了该操作。

This list will quickly show who has been doing what.

youdao

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

好，二分查找的基本前提，或者是我们建立二分查找的基础,我们已经有了一个排好序的元素列表，我们就需要知道如何来快速的排序,如何从列表中找到特定的元素。

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