Suppose a sorted array is rotated at some pivot unknown to you beforehand.
如果首个元素小于最后一个元素，表明数组是排序的。
Given two sorted integer arrays a and B, merge B into a as one sorted array.
题意要把两个有序的数组合并到他们中的一个数组中。
Quick sorts, unlike merge sorts, have no combining step: two subarrays form an already-sorted array.
快速排序，与合并排序，没有结合一步：两个子阵形成一个已经排好序的数组。
With the simple scoring procedures in place and a sorted array of result text, we can print the results.
利用就绪的简单评分过程和已排序的结果文本数组，我们可以打印结果。
Then, the select list is cleared and the select list options are set to the values contained in the sorted array.
然后，选择列表被清空，接着被设置为排序后数组中包含的值。
You want to iterate through the list, breaking each word into a sorted array of letters, then joining the array again.
需要遍历该列表，将每个单词拆分为经过排序的字母数组，然后再次合并数组。
With the index array of scores created, we use the standard sort command as described in section 4 of the perlfaq to create the @sorted array of ordered search results.
创建分数索引数组后，我们将按照perlfaq的第 4部分中的说明使用标准排序命令来创建排序后搜索结果的 @sorted 数组。
Google's GAE documentation describes Bigtable as a sharded, sorted array, but I find it easier to think of it as a gigantic hashtable chunked out across a bazillion servers.
Google的GAE文档将Bigtable描述为一个分散的排序阵列，但是我发现将它描述为一个巨大的分布在无数服务器的哈希表更好理解。
The expired array contains a sorted list of all tasks whose timeslices have expired.
过期数组中包含了一个时间片已经用尽的所有任务的有序列表。
sortBy is an array of sort objects that determines how the returned array is sorted.
sortBy是一个sort对象数组，用于确定如何对返回的数组排序。
The problem with this code is that when the array of values is sorted, the count of duplicates will no longer be accurate.
这部分代码的问题是，如果数组中的值已经排序，那么重复值计数就不再准确。
One case of replacement is sorting, where elements are replaced with different elements so that the resulting array is in sorted order (the built-in sort method is provided for this action).
替换的一种情况是排序，将元素替换为不同的元素，从而对其进行排序(内置的sort方法可用于此操作)。
I have already sorted the array.
我已经排好序的数组。
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?
如果数组已经排好序，怎样优化你的算法？
应用推荐