Consider the worst cases of the following sorting algorithms, which of them can [ ]achieve the sorting lower bound? A: Heap sort B: Insertion sort C: Merge sort D: Selection sort

插入序列（insertion sequence，IS）

The following is a list of manipulation methods of Shaoze (SI 1) , which one is right ? A: prick to cause bleeding B: Perpendicular insertion 0. 5-1.0 cun C: Oblique insertion 0.5-0.8 cun D: Perpendicular insertion 0. 3- 0.5 cun E: Oblique insertion 0.5 -1.0 cun

名词insertion的动词形式是______.

I was _________ hoping to leave early today. A: a sort of B: a kind of C: of a sort D: sort of

12 In the following sort algorithms, the sorting algorithm that is suitable for a large number of records keywords, but with a small number of keywords to be sorted is（ ）. A: cardinality sort B: quick Sort C: merge sort D: heap sort

I was hoping _______ to leave early today. A: a sort of B: sorts of C: sort off D: sort of

She isn’t beautiful. But she is ( ) pretty. A: a kind of B: a sort of C: sort of D: of a sort

She<br/>isn’t beautiful. But she is ________ pretty. A: a sort of B: a kind of C: of a sort D: sort of

Hadoop中， Reducer 的三个阶段是() A: Shuffle ——Sort ——Reduce B: Shuffle ——Reduce——Sort C: Reduce——Shuffle ——Sort D: Sort ——Shuffle ——Reduce