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.

然后，选择列表被清空，接着被设置为排序后数组中包含的值。