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
A: Heap sort
B: Insertion sort
C: Merge sort
D: Selection 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
- is a good way to save resources. A: Sort refusing B: Sort refuse C: Sorting refuse D: Sorting refusing
- It took quite a while to all our luggage. A: sort out B: sort off C: sorting D: sort in
- 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
- I’d like to have these documents _______ in a minute. A: sorting out B: sorted out C: to be sorted out D: sort out