1.If you only want to get the sequence before the fifth smallest element in the sequence of composed 1000 elements, the ( ) method is the fastest.
A: heap sort
B: bubble sort
C: quick sort
D: shell sort
A: heap sort
B: bubble sort
C: quick sort
D: shell sort
举一反三
- 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
- 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
- I was _________ hoping to leave early today. A: a sort of B: a kind of C: of a sort D: sort of
- 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