排序算法比较

                               时间复杂度(平均）                    空间复杂度

1.冒泡                             O(n^2)                              O(1)

2.快速                             O(nlogn)                           O(logn)   

3.插入                             O(n^2)                              O(1) 

4.希尔                             O(nlogn)                           O(1)    

5.选择                             O(n^2)                              O(1)

6.堆                                 O(nlogn)                           O(1)

7.归并                             O(nlogn)                           O(n)

8.计数                             O(n+k)                              O(k)

9.基数                             O(n+k)                              O(n+k)

10.桶                               O(n+k)                              O(n+k)