常见排序算法的时间复杂度、稳定性总结

常见排序算法包括：插入排序，希尔排序，冒泡排序，选择排序，快速排序，堆排序，归并排序，基数排序

 名称                      时间复杂度（按照最好、最坏、平均排列）          空间复杂度                  稳定性

 插入排序               O(n) O(n^2)  O(n^2)                                               O(1)                               稳定

希尔排序              平均为O(n^1.3)                                                        O(1)                                不稳定

 冒泡排序             O(n) O(n^2 ) O(n^2)                                                O(1)                                   稳定

 选择排序              均为O(n^2)                                                             O(1)                                   不稳定

 快速排序               O(nlgn) O(n^2) O(nlgn)                                         O(lgn)                                   不稳定

 堆排序                   均为O(nlgn)                                                           O(1)                                      不稳定

 归并排序              O(nlgn)  O(nlgn)                                                      O(n)                                       稳定

 基数排序                                                                                             O(r) r个队列                             稳定