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
A: cardinality sort
B: quick Sort
C: merge sort
D: heap sort
A
举一反三
- 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
- 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
- It took quite a while to all our luggage. A: sort out B: sort off C: sorting D: sort in
- is a good way to save resources. A: Sort refusing B: Sort refuse C: Sorting refuse D: Sorting refusing
- After work I am____tired. A: sorts of B: sort of C: sorted of D: a sort of
内容
- 0
I was _________ hoping to leave early today. A: a sort of B: a kind of C: of a sort D: sort of
- 1
I’d like to have these documents _______ in a minute. A: sorting out B: sorted out C: to be sorted out D: sort out
- 2
已知L=[1,3,7,5,-1]，下列哪个语句能实现L的降序排序？（ ） A: sort( ) B: sort(True) C: sorted(reverse=False) D: sort(reverse=True)
- 3
I was hoping _______ to leave early today. A: a sort of B: sorts of C: sort off D: sort of
- 4
She isn’t beautiful. But she is ( ) pretty. A: a kind of B: a sort of C: sort of D: of a sort