现在，我需要合并已排好序的部分。
我已经排好序的数组。
让我们来假设目前的情况是：，我已经有两个已排好序的列表。
Let's assume that I could somehow get to the stage where I've got two sorted lists.
为协调和控制排好序的材料，排序的操作员应安装一个车辆序列跟踪系统。
The Sequencing Operator shall install a Vehicle sequence Tracking System for coordination and control of sequenced material.
快速排序，与合并排序，没有结合一步：两个子阵形成一个已经排好序的数组。
Quick sorts, unlike merge sorts, have no combining step: two subarrays form an already-sorted array.
然后对于前10个搜索，为每个搜索创建HTML，并将它们附加到一个排好序的列表。
Then take the top 10 searches, create HTML for each search, and append them to an ordered list.
用户做出选择之后，在提交时处理程序会收到排好序的目标列表，其中包含用户的选择。
After the user has made the desired choices, on submittal your handler receives the ordered target list containing the choices.
默认情况下，ProcessServer可以提供100个锁定来处理这些排好序的消息。
By default, process Server provides 100 locks to process these sequenced messages.
例如，假设我想要上面描述的非增量且排好序的电影队列在其发布之后10天(864,000,000毫秒)后过期。
Suppose, for instance, that I want the non-incremental, ordered movie queue illustrated above to expire 10 days (864,000,000 milliseconds) after it was published.
没关系，我告诉过你在课程的开始，我们假设这是一个排好序的列表，然后才进行的搜索，那实际上有序列表从哪里来的呢？
I remind you, I know you're not really listening to me, but that's OK. I reminded you at the beginning of the lecture, I said, let's assume we have a sorted list, and then let's go search it.
索引也是一种DB 2对象(一个单独的VSAM数据集)，它由一组排好序的键组成，这些键是从相应表中的一个列或多个列抽取出来的。
An index is a DB2 object (a separate VSAM dataset) that is comprised of an ordered set of keys extracted from one or more columns of the corresponding table.
如果为索引表空间使用较大的缓冲池，并且尽可能地将不同 insert排序，以便键值是排好序的，而不是随机的，就可以帮助加快索引维护。
You can help speed up index maintenance by using a large buffer pool for the index tablespace, and, if possible, ordering the inserts so that the key values are ordered, not random.
当然现在我们不需要那样做，此时此刻，我已对整个问题中大小为4的列表排好序了。
We don't seem to be doing that just yet, certainly not as badly, alright, so at this point in the story I have a sorted list of size 4.
现在大小为2的列表已排好序了。
这样你就能够很容易为把你认为重要的事情排好序。
一半的建议是专为具有A型人格的军事操练教官设计的，这些人已经按字母顺序给冰箱里的食物排好了序。另一半你已经听说过了。
Half of it is designed for Type-A drill sergeants who already alphabetize their refrigerators. The other half you've heard before.
这可能大概就是数组的长度，因为我会遍历数组中的每个元素一次，现在你可能会想，等等，数组已经排好序了。
And if I'm walking down the list, this is probably order of the length of the lists because I'm looking at each element once.
对这个较小的问题我已经排好序了，因为在这个小问题中只有1个元素1，那么很明显，这个杯子已经是有序的了。
I have sorted with the smaller problem 1 because that smaller problem right now is of size 1 and so it's sort of obviously the case that this cup is now sorted.
同样，如果你展开正在进行的一切-，我们已对左半部分排好了序，接着右半部分，接着合并。
So again, if you're unwinding what's going on here, this — we sorted the left half which meant sort the left half, then the right half then the merge.
如果数组已经排好序，怎样优化你的算法？
What if the given array is already sorted? How would you optimize your algorithm?
如果数组已经排好序，怎样优化你的算法？
What if the given array is already sorted? How would you optimize your algorithm?
应用推荐