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

发布网友发布时间：2022-04-29 07:10

共4个回答

热心网友时间：2022-05-22 02:55

另外一个答案不靠谱啊
正确答案应该是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 proce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output.

来源Wiki

热心网友时间：2022-05-22 04:13

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

热心网友时间：2022-05-22 05:47

c追问真的么？

追答恩

热心网友时间：2022-05-22 07:39

d吧追问嗯嗯，谢谢哈