摘要:
摘自《数据结构教程》(第三版)李春葆等编著 清华大学出版社 P296排序方法平均情况最坏情况最好情况空间复杂度稳定性复杂性直接插入排序O(n2)O(n2)O(n)O(1)稳定简单希尔排序O(n1.3)O(1)不稳定较复杂冒泡排序O(n2)O(n2)O(n)O(1)稳定简单快速排序O(nlog2n)O(n2)O(nlog2n)O(log2n)不稳定较复杂直接选择排序O(n2)O(n2)O(n2)O(1)不稳定简单堆排序O(nlog2n)O(nlog2n)O(nlog2n)O(1)不稳定较复杂归并排序O(nlog2n)O(nlog2n)O(nlog2n)O(n)稳定较复杂基数排序O(d(n+r)) 阅读全文