下列排序算法中,()是稳定的? a.插入,希尔 b.冒泡,快速 c.选择,堆排序 d.基数,归并

2024-11-23 00:18:54
推荐回答(4个)
回答1:

另外一个答案不靠谱啊
正确答案应该是D

对基数排序:
A least significant digit (LSD) radix sort is a fast stable sorting algorithm which can be used to sort keys in integer representation order.
对归并排序:
In computer science, merge sort (also commonly spelled mergesort) is an O(n log n) comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output.

来源Wiki

回答2:

选d,基数,归并是稳定排序

回答3:

c

回答4:

d吧