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

What are the main selection of equipment in the fully mechanized working face? ( ) A: Selection of fully mechanized support B: Selection of Shearer C: Selection of face conveyor D: Selection of conveyor in gateway

关于SELECTION-SORT算法的基本思想，下列说法正确的是_____

selection

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

The basis of selection is ( ).